Granted Patent B2

US 12,411,829 · App. 18/310,455 · Granted Sep 9, 2025

Inventor: Adam Szymański (Warsaw, PL)

Assignee: Oxla sp. z o.o.

G06F16/2255G06F16/2237G06F16/24542G06F16/2455G06F16/24552G06F16/2456G06F16/24561

Abstract

Claims (71)

1. A computer-implemented method for executing database queries, the computer-implemented method comprising:

receiving, by a database system, a database query for processing data stored in one or more input tables;

generating a hash table configured to store a plurality of keys, each of the plurality of keys associated with one or more data values; generating the hash table comprising:

applying a hash function to the plurality of keys to map each of the plurality of keys to a corresponding position within the hash table; and

storing the plurality of keys and associated data values in the hash table at their corresponding positions, such that the plurality of keys and associated data values are stored in a particular order in the hash table;

processing the database query, comprising:

receiving a set of records, each record associated with a key;

reordering the set of records to obtain a reordered set of records that is at least partially sorted to match the particular order of the plurality of keys in the hash table, wherein the reordering comprises:

performing a first pass through the set of records to determine a count of records assigned to each of a plurality of buckets, wherein the buckets are defined based on the hash function;

computing, based on the counts, an offset for each bucket representing a position for storing records assigned to the respective bucket; and

performing a second pass through the set of records to place the records in positions based on their respective bucket offsets, thereby obtaining the reordered set of records;

accessing the hash table in order of the reordered set of records, comprising, for each record of the reordered set of records, accessing a data value stored in the hash table that is mapped to a key corresponding to the record; and

determining a set of results based on data values accessed from the hash table; and

providing the set of results as a result of processing the database query.

2. The computer-implemented method of claim 1 , wherein the database query specifies a group by operation that determines an aggregate value for each group based on keys of the hash table, wherein the data value stored in the hash table that is mapped to a key corresponding to the record is a partial aggregate value determined based on a subset of the set of records processed.

3. The computer-implemented method of claim 1 , wherein the database query specifies a join operation between a first table and a second table, wherein the hash table stores data values based on the first table, and the set of records is from the second table.

4. The computer-implemented method of claim 1 , wherein applying the hash function to the plurality of keys comprises:

determining a plurality of buckets, wherein a number of buckets is determined based on a number of keys that can be stored in the hash table, wherein the buckets are ordered;

associating each record of the set of record with a bucket from the plurality of buckets; and

processing the keys in an order of the buckets.

5. The computer-implemented method of claim 4 , wherein a set of keys assigned to a bucket are stored in proximity with each other in the hash table compared to keys assigned to other buckets.

6. The computer-implemented method of claim 4 , wherein the number of buckets is a power of two.

7. The computer-implemented method of claim 4 , wherein the database query is processed using a plurality of processors, wherein a first subset of the set of records associated with a first bucket is processed using a first processor and a second subset of the set of records associated with a second bucket is processed using a second processor.

8. A computer readable storage medium storing instructions for a method for executing database queries, the instructions when executed by a computer processor cause the computer processor to perform steps comprising:

receiving, by a database system, a database query for processing data stored in one or more input tables;

generating a hash table configured to store a plurality of keys, each of the plurality of keys associated with one or more data values, generating the hash table comprising:

applying a hash function to the plurality of keys to map each of the plurality of keys to a corresponding position within the hash table; and

storing the plurality of keys and associated data values in the hash table at their corresponding positions, such that the plurality of keys and associated data values are stored in a particular order in the hash table;

processing the database query, comprising:

receiving a set of records, each record associated with a key;

reordering the set of records to obtain a reordered set of records that is at least partially sorted to match the order of keys in the hash table, wherein the reordering comprises:

performing a first pass through the set of records to determine a count of records assigned to each of a plurality of buckets, wherein the buckets are defined based on the hash function;

computing, based on the counts, an offset for each bucket representing a position for storing records assigned to the respective bucket; and

performing a second pass through the set of records to place the records in positions based on their respective bucket offsets, thereby obtaining the reordered set of records;

accessing the hash table in order of the reordered set of records, comprising, for each record of the reordered set of records, accessing a data value stored in the hash table that is mapped to a key corresponding to the record; and

determining a set of results based on data values accessed from the hash table; and

providing the set of results as a result of processing the database query.

9. The computer readable storage medium of claim 8 , wherein the database query specifies a group by operation that determines an aggregate value for each group based on keys of the hash table, wherein the data value stored in the hash table that is mapped to a key corresponding to the record is a partial aggregate value determined based on a subset of the set of records processed.

10. The computer readable storage medium of claim 8 , wherein the database query specifies a join operation between a first table and a second table, wherein the hash table stores data values based on the first table, and the set of records is from the second table.

11. The computer readable storage medium of claim 8 , wherein applying a hash function to the plurality of keys comprises:

determining a plurality of buckets, wherein a number of buckets is determined based on a number of keys that can be stored in the hash table, wherein the buckets are ordered;

associating each record of the set of record with a bucket from the plurality of buckets; and

processing the keys in an order of the buckets.

12. The computer readable storage medium of claim 11 , wherein a set of keys assigned to a bucket are stored in proximity with each other in the hash table compared to keys assigned to other buckets.

13. The computer readable storage medium of claim 11 , wherein the number of buckets is a power of two.

14. The computer readable storage medium of claim 11 ,

wherein the database query is processed using a plurality of processors, wherein a first subset of the set of records associated with a first bucket is processed using a first processor and a second subset of the set of records associated with a second bucket is processed using a second processor.

15. A computer system comprising:

a computer processor; and

a computer-implemented method for executing database queries, the computer-implemented method comprising:

receiving, by a database system, a database query for processing data stored in one or more input tables;

generating a hash table configured to store a plurality of keys, each of the plurality of keys associated with one or more data values, generating the hash table comprising:

applying a hash function to the plurality of keys to map each of the plurality of keys to a corresponding position within the hash table; and

storing the plurality of keys and associated data values in the hash table at their corresponding positions, such that the plurality of keys and associated data values are stored in a particular order in the hash table;

processing the database query, comprising:

receiving a set of records, each record associated with a key;

reordering the set of records to obtain a reordered set of records that is at least partially sorted to match the order of keys in the hash table, wherein the reordering comprises:

performing a first pass through the set of records to determine a count of records assigned to each of a plurality of buckets, wherein the buckets are defined based on the hash function;

computing, based on the counts, an offset for each bucket representing a position for storing records assigned to the respective bucket; and

performing a second pass through the set of records to place the records in positions based on their respective bucket offsets, thereby obtaining the reordered set of records;

accessing the hash table in order of the reordered set of records, comprising, for each record of the reordered set of records, accessing a data value stored in the hash table that is mapped to a key corresponding to the record; and

determining a set of results based on data values accessed from the hash table; and

providing the set of results as a result of processing the database query.

16. The computer system of claim 15 , wherein the database query specifies a group by operation that determines an aggregate value for each group based on keys of the hash table, wherein the data value stored in the hash table that is mapped to a key corresponding to the record is a partial aggregate value determined based on a subset of the set of records processed.

17. The computer system of claim 15 , wherein the database query specifies a join operation between a first table and a second table, wherein the hash table stores data values based on the first table, and the set of records is from the second table.

18. The computer system of claim 15 , wherein applying a hash function to the plurality of keys comprises:

determining a plurality of buckets, wherein a number of buckets is determined based on a number of keys that can be stored in the hash table, wherein the buckets are ordered;

associating each record of the set of record with a bucket from the plurality of buckets; and

processing the keys in an order of the buckets.

19. The computer system of claim 18 , wherein a set of keys assigned to a bucket are stored in proximity with each other in the hash table compared to keys assigned to other buckets.

20. The computer system of claim 18 , wherein the database query is processed using a plurality of processors, wherein a first subset of the set of records associated with a first bucket is processed using a first processor and a second subset of the set of records associated with a second bucket is processed using a second processor.

Assignments (2)

Priority Claims (1)

Continuity (1)

References Cited (37)