Merges using key range data structures
Assigneesalesforce.com, inc.
InventorsRohit Agrawal, Aditya Shetty, Kaushal Mittal, Terry Chong, Thomas Fanghaenel, Vaibhav Arora
Life of this patent
Estimating the term…
Loading patent…
Assigneesalesforce.com, inc.
InventorsRohit Agrawal, Aditya Shetty, Kaushal Mittal, Terry Chong, Thomas Fanghaenel, Vaibhav Arora
Estimating the term…
Techniques are disclosed relating to merge operations for multi-level data structures, such as log-structured merge-trees (LSM trees). A computer system may store, in a database, a plurality of files as part of an LSM tree and a plurality of database key structures. A given one of the plurality of database key structures may indicate, for a corresponding one of the plurality of files, a set of key ranges derived from database records that are included in the corresponding file. The computer system may determine, using ones of the plurality of database key structures, a key range overlap that is indicative of an extent of overlap of key ranges from a set of the plurality of files with respect to a particular key range. Based on the determined key range overlap, the computer system may assign a priority level to a merge operation that involves the set of files.
A method, comprising:
A non-transitory computer readable medium having program instructions stored thereon that are executable by a computer system to cause the computer system to perform operations comprising:
A method, comprising:
Dependencies are inferred from the claim text.