US 12,007,971 B2
Pageable hash index for document store
Christian Bensberg, Heidelberg (DE); Daniel Ritter, Heidelberg (DE); and Neeraj Kulkarni, Walldorf (DE)
Assigned to SAP SE, Walldorf (DE)
Filed by SAP SE, Walldorf (DE)
Filed on Jun. 10, 2020, as Appl. No. 16/898,143.
Claims priority of application No. 202011017834 (IN), filed on Apr. 27, 2020.
Prior Publication US 2021/0334257 A1, Oct. 28, 2021
Int. Cl. G06F 16/00 (2019.01); G06F 16/22 (2019.01); G06F 16/93 (2019.01)
CPC G06F 16/2255 (2019.01) [G06F 16/94 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method, comprising:
generating, by one or more processors, a hash map index for data stored on disk using a document array, wherein the hash map index comprises a plurality of buckets, each bucket in the plurality of buckets storing one or more hash values of a plurality of hash values included in the hash map index, wherein each bucket is determined using significant bits of hash values stored by a respective bucket, wherein each hash value in the plurality of hash values identifies a document stored at a predetermined location in the document array, and wherein a size of the hash map index is determined as a modulo of a size of the document array;
receiving, by the one or more processors, a transaction for execution using a first document stored in the document array;
identifying, by the one or more processors, using the generated hash map index, significant bits of a corresponding bucket and the size of the hash map index, a location of the first document stored in the document array;
loading, by the one or more processors, into a memory location, a portion of a first hash value of the hash map index identified by the significant bits of the corresponding bucket storing the first hash value and corresponding to the first document without loading remaining hashes of the hash map index not identified by the significant bits; and
executing, by the one or more processors, based on the portion of the first hash value, the transaction.