Patents by Inventor David Galimberti

David Galimberti has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Disk-based hash join process
    Patent number: 9275110
    Abstract: A database system performs hash join process for processing queries that join an inner and an outer database table. The hash join processes builds a hash table in memory for the inner table. The database system receives a limit on the memory for storing the hash table. The database system maximizes the number of partitions stored in memory for the hash table. If the hash table exceeds the limit of the memory while adding rows from the inner table, the database system selects a partition for spilling to a persistent storage. The partition selected for spilling to may be the largest partition or a partition larger than most of the partitions. The database system initializes the hash table to a number of partitions that is substantially equal to half of the total number of blocks that can be stored within the specified limit of memory for the hash table.
    Type: Grant
    Filed: March 1, 2013
    Date of Patent: March 1, 2016
    Assignee: ParAccel LLC
    Inventors: Mayank Pradhan, David Galimberti, Brian Pak-Ning Chu, David Wilhite, Jr., Adam Birnbaum, Raymi Dyskant
  • DISK-BASED HASH JOIN PROCESS
    Publication number: 20140250142
    Abstract: A database system performs hash join process for processing queries that join an inner and an outer database table. The hash join processes builds a hash table in memory for the inner table. The database system receives a limit on the memory for storing the hash table. The database system maximizes the number of partitions stored in memory for the hash table. If the hash table exceeds the limit of the memory while adding rows from the inner table, the database system selects a partition for spilling to a persistent storage. The partition selected for spilling to may be the largest partition or a partition larger than most of the partitions. The database system initializes the hash table to a number of partitions that is substantially equal to half of the total number of blocks that can be stored within the specified limit of memory for the hash table.
    Type: Application
    Filed: March 1, 2013
    Publication date: September 4, 2014
    Applicant: ParAccel, Inc.
    Inventors: Mayank Pradhan, David Galimberti, Brian Pak-Ning Chu, David Wilhite, JR., Adam Birnbaum, Raymi Dyskant