Methods and systems of splitting database indexes and digests
OwnerBrian J. Bulkowski, Andrew Gooding +1inventors
InventorsBRIAN J. BULKOWSKI, Andrew Gooding, VENKATACHARY SRINIVASAN
Life of this patent
Estimating the term…
Abstract
A computer-implemented method of a distributed database system includes generating a database index. The method includes mapping a first specified number of bits of the database index to a database key. The method includes mapping a second specified number of bits to a data object associated with the database key. The method includes storing the first specified number of bits of the database key in a dram memory. The method includes storing second specified number of bits with the data object in a solid-state device (SSD) storage.
Claims20
A computer-implemented method of a database comprising:
- assigning a unique key to a record of a database;
- hashing the unique key into a digest;
- randomizing the digest;
- storing the digest in an index tree;
- assigning each index element to a node in the index tree;
- assigning twelve (12) bits of the digest to store information that determines which partitions to assign a record;
- assigning six (6) bits of the digest to store information that determines which storage device on which to store the record;
- assigning fourteen (14) bits to store information that determines a record lock to use on the record.
A computer-implemented method of a distributed database system comprising:
- generating a database index;
- mapping a first specified number of bits of the database index to a database key;
- mapping a second specified number of bits to a data object associated with the database key;
- storing the first specified number of bits of the database key in a dram memory;
- and
- storing second specified number of bits with the data object in a solid state device (SSD) storage.
A computer-implemented method of a database comprising:
- assigning a unique key to a record of a database;
- hashing the unique key into a digest;
- randomizing the digest;
- storing the digest in an index tree;
- assigning each index element to a node in the index tree;
- assigning a first specified number of bits of the digest to store information that determines which partitions to assign a record;
- signing a second specified number of bits of the digest to store information that determines which storage device on which to store the record;
- assigning a third specified number of bits to store information that determines a record lock to use on the record.
Dependencies are inferred from the claim text.