KEY-VALUE STORE TREE WITH SELECTIVE USE OF KEY PORTION
First Claim
1. A system comprising:
- a set of memory components storing a key-value store tree data structure, the key-value store tree data structure comprising a set of nodes, wherein a node in the set of nodes comprises a set of key-value pairs; and
a processing device, operatively coupled to the set of memory components, configured to perform operations comprising;
receiving a request to search the key-value store tree data structure for a particular key-value pair associated with a particular key;
in response to receiving the request, searching a root node of the key-value store tree data structure for the particular key-value pair associated with the particular key; and
in response to determining that the root node does not comprise the particular key-value pair, searching the key-value store tree data structure, based on the key, for a child node that comprises the particular key-value pair, the searching comprising;
searching one or more child nodes of a first set of levels of the key-value store tree data structure based on a first portion of the particular key; and
in response to determining that at least one child node of the first set of levels of the key-value store tree data structure does not comprise the particular key-value pair, searching one or more child nodes of a second set of levels of the key-value store tree data structure based on a second portion of the key, the second portion being different from the first portion.
5 Assignments
0 Petitions
Accused Products
Abstract
Aspects of the present disclosure provide various embodiments for selective use of a portion of a key, such as a prefix of the key (also referred to as a key prefix of a key), with respect to a key-value store (KVS) tree data structure, such as when storing a key-value pair (associated with the key) within the KVS tree data structure or navigating through the KVS tree data structure. For some embodiments, when navigating a KVS tree based on a key, a first set of levels (e.g., a first series of levels) of the KVS tree is navigated by a first portion (e.g., a prefix) of the key, and a second set of levels (e.g., a second series of levels) of the KVS tree is navigated by a second portion (e.g., an entire portion) of the key.
12 Citations
20 Claims
-
1. A system comprising:
-
a set of memory components storing a key-value store tree data structure, the key-value store tree data structure comprising a set of nodes, wherein a node in the set of nodes comprises a set of key-value pairs; and a processing device, operatively coupled to the set of memory components, configured to perform operations comprising; receiving a request to search the key-value store tree data structure for a particular key-value pair associated with a particular key; in response to receiving the request, searching a root node of the key-value store tree data structure for the particular key-value pair associated with the particular key; and in response to determining that the root node does not comprise the particular key-value pair, searching the key-value store tree data structure, based on the key, for a child node that comprises the particular key-value pair, the searching comprising; searching one or more child nodes of a first set of levels of the key-value store tree data structure based on a first portion of the particular key; and in response to determining that at least one child node of the first set of levels of the key-value store tree data structure does not comprise the particular key-value pair, searching one or more child nodes of a second set of levels of the key-value store tree data structure based on a second portion of the key, the second portion being different from the first portion. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A method comprising:
-
generating, on a set of memory components, a key-value store tree data structure, the key-value store tree data structure comprising a set of nodes, wherein a node in the set of nodes comprises a set of key-value pairs; receiving a request to search the key-value store tree data structure for a particular key-value pair associated with a particular key; in response to receiving the request, searching a root node of the key-value store tree data structure for the particular key-value pair associated with the particular key; and in response to determining that the root node does not comprise the particular key-value pair, searching the key-value store tree data structure, based on the key, for a child node that comprises the particular key-value pair, the searching comprising; searching one or more child nodes of a first set of levels of the key-value store tree data structure based on a first portion of the particular key; and response to determining that at least one child node of the first set of levels of the key-value store tree data structure does not comprise the particular key-value pair, searching one or more child nodes of a second set of levels of the key-value store tree data structure based on a second portion of the key, the second portion being different from the first portion. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A non-transitory machine-readable storage medium comprising instructions that, when executed by a processing device, cause the processing device to:
-
access, on a set of memory components, a key-value store tree data structure, the key-value store tree data structure comprising a set of nodes, wherein a node in the set of nodes comprises a set of key-value pairs; receive a request to search the key-value store tree data structure for a particular key-value pair associated with a particular key; in response to the request, search a root node of the key-value store tree data structure for the particular key-value pair associated with the particular key; and in response to determining that the root node does not comprise the particular key-value pair, searching the key-value store tree data structure, based on the key, for a child node that comprises the particular key-value pair, the searching comprising; search one or more child nodes of a first set of levels of the key-value store tree data structure based on a first portion of the particular key; and in response to determining that at least one child node of the first set of levels of the key-value store tree data structure does not comprise the particular key-value pair, searching one or more child nodes of a second set of levels of the key-value store tree data structure based on a second portion of the particular key, the second portion being different from the first portion.
-
Specification