Disk-based merge for combining merged hash maps
AssigneeSap SE
InventorsChristian Bensberg, Frederik Transier, Kai Stammerjohann
Life of this patent
Estimating the term…
Abstract
Various embodiments for a disk-based merge for combining merged hash maps are described herein. An embodiment operates by identifying a first hash map and a second hash map, and comparing a first hash value from the first hash map with a second hash value from the second hash map, with the lowest index values. A lowest hash value is identified based on the comparison, and an entry corresponding to the lowest hash value is stored in a combined hash map. This process is repeated until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map. A query is received, and processed based on the combined hash map.
Claims20
A method comprising:
- identifying a first hash map and a second hash map, wherein the first hash map comprises a first set of index values corresponding to a first set of data values and a first set of hash values corresponding to the first set of data values, and wherein the second hash map includes a second set of index values corresponding to a second set of data values and a second set of hash values corresponding to the second set of data values;
- comparing a first hash value from the first hash map, with a lowest index value of the first set of index values, with a second hash value from the second hash map, with a lowest index value of the second set of index values;
- identifying a lowest hash value between the first hash value and the second hash value based on the comparison;
- storing the lowest hash value and its corresponding index value and data value in a combined hash map;
- repeating the comparing, identifying the lowest hash value, and storing for both the first set of hash values and the second set of hash values, until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map;
- receiving a query comprising one of a query data value or a query index value;
- and
- returning a result to the query, wherein the query was processed based on the combined hash map.
A system comprising at least one processor, the at least one processor configured to perform operations comprising:
- identifying a first hash map and a second hash map, wherein the first hash map comprises a first set of index values corresponding to a first set of data values and a first set of hash values corresponding to the first set of data values, and wherein the second hash map includes a second set of index values corresponding to a second set of data values and a second set of hash values corresponding to the second set of data values;
- comparing a first hash value from the first hash map, with a lowest index value of the first set of index values, with a second hash value from the second hash map, with a lowest index value of the second set of index values;
- identifying a lowest hash value between the first hash value and the second hash value based on the comparison;
- storing the lowest hash value and its corresponding index value and data value in a combined hash map;
- repeating the comparing, identifying the lowest hash value, and storing for both the first set of hash values and the second set of hash values, until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map;
- receiving a query comprising one of a query data value or a query index value;
- and
- returning a result to the query, wherein the query was processed based on the combined hash map.
A non-transitory computer-readable medium having instructions stored thereon that, when executed by at least one computing device, cause the at least one computing device to perform operations comprising:
- identifying a first hash map and a second hash map, wherein the first hash map comprises a first set of index values corresponding to a first set of data values and a first set of hash values corresponding to the first set of data values, and wherein the second hash map includes a second set of index values corresponding to a second set of data values and a second set of hash values corresponding to the second set of data values;
- comparing a first hash value from the first hash map, with a lowest index value of the first set of index values, with a second hash value from the second hash map, with a lowest index value of the second set of index values;
- identifying a lowest hash value between the first hash value and the second hash value based on the comparison;
- storing the lowest hash value and its corresponding index value and data value in a combined hash map;
- repeating the comparing, identifying the lowest hash value, and storing for both the first set of hash values and the second set of hash values, until all of the hash values from both the first set of hash values and the second set of hash values are stored in the combined hash map;
- receiving a query comprising one of a query data value or a query index value;
- and
- returning a result to the query, wherein the query was processed based on the combined hash map.
Dependencies are inferred from the claim text.