KVS tree
First Claim
Patent Images
1. A key-value data structure, organized as a tree, on at least one non-transitory machine readable medium, the key-value data structure comprising:
- a multiple of nodes, a node from the multiple of nodes comprising;
a temporally ordered sequence of immutable key-value sets (kvsets), the temporally ordered sequence comprising an oldest kvset at one end of the temporally ordered sequence and a newest kvset at another end of the temporally ordered sequence; and
a determinative mapping for a key-value pair, in a kvset of the temporally ordered sequence of immutable key-value sets, to any one child node of the node, the key-value pair comprising one key and one value, the one key being unique in the kvset, the kvset holding storing multiple key-value pairs, the determinative mapping providing a rule such that any key-value pair maps to a specific path through the tree to a specific child node at any level of the tree without regard to node content of the tree.
5 Assignments
0 Petitions
Accused Products
Abstract
A KVS tree and operations thereon are described herein. A key-value set (kvset) is received to store in a key-value data structure on at least one machine readable medium. The kvset includes a mapping of unique keys to values with the keys and the values of the kvset being immutable. The key-value data structure is organized as a tree with nodes of the tree including a temporally ordered sequence of kvsets. The kvset, once received, is written to a sequence of kvsets of a root-node of the tree.
48 Citations
45 Claims
-
1. A key-value data structure, organized as a tree, on at least one non-transitory machine readable medium, the key-value data structure comprising:
a multiple of nodes, a node from the multiple of nodes comprising; a temporally ordered sequence of immutable key-value sets (kvsets), the temporally ordered sequence comprising an oldest kvset at one end of the temporally ordered sequence and a newest kvset at another end of the temporally ordered sequence; and a determinative mapping for a key-value pair, in a kvset of the temporally ordered sequence of immutable key-value sets, to any one child node of the node, the key-value pair comprising one key and one value, the one key being unique in the kvset, the kvset holding storing multiple key-value pairs, the determinative mapping providing a rule such that any key-value pair maps to a specific path through the tree to a specific child node at any level of the tree without regard to node content of the tree. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18)
-
19. A system comprising processing circuitry to:
-
receive a key-value set (kvset) to store in a key-value data structure, organized as a tree on at least one non-transitory machine readable medium, the kvset comprising a mapping of unique keys to values, the keys and the values of the kvset being immutable, a node of the tree comprising; a temporally ordered sequence of kvsets with key-value pairs with keys that determinatively map to the nodes, the temporally ordered sequence comprising an oldest kvset at one end of the temporally ordered sequence and a newest kvset at another end of the temporally ordered sequence; and a determinative mapping for a key-value pair, in a kvset of the temporally ordered sequence of immutable key-value sets, to any one child node of the node, the key-value pair comprising one key and one value, the one key being unique in the kvset, the kvset storing multiple key-value pairs, the determinative mapping providing a rule such that any key-value pair maps to a specific path through the tree to a specific child node at any level of the tree without regard to node content of the tree; and write the kvset to a sequence of kvsets of a root-node of the tree. - View Dependent Claims (20, 21, 22)
-
-
23. At least one non-transitory machine readable medium comprising instructions that, when executed by processing circuitry, cause a machine to perform operations comprising:
-
receiving a key-value set (kvset) to store in a key-value data structure, organized as a tree, of at least one machine readable medium, the kvset comprising a mapping of unique keys to values, the keys and the values of the kvset being immutable, a node of the tree comprising; a temporally ordered sequence of kvsets with key-value pairs with keys that determinatively map to the nodes, the temporally ordered sequence comprising an oldest kvset at one end of the temporally ordered sequence and a newest kvset at another end of the temporally ordered sequence; and a determinative mapping for a key-value pair, in a kvset of the temporally ordered sequence of immutable key-value sets, to any one child node of the node, the key-value pair comprising one key and one value, the one key being unique in the kvset, the kvset storing multiple key-value pairs, the determinative mapping providing a rule such that any key-value pair maps to a specific path through the tree to a specific child node at any level of the tree without regard to node content of the tree; and writing the kvset to a sequence of kvsets of a root-node of the tree. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34)
-
-
35. A method comprising:
-
receiving a key-value set (kvset) to store in a key-value data structure, organized as a tree on at least one non-transitory machine readable medium, the kvset comprising a mapping of unique keys to values, the keys and the values of the kvset being immutable, a node of the tree comprising; a temporally ordered sequence of kvsets with key-value pairs with keys that determinatively map to the nodes, the temporally ordered sequence comprising an oldest kvset at one end of the temporally ordered sequence and a newest kvset at another end of the temporally ordered sequence; and a determinative mapping for a key-value pair, in a kvset of the temporally ordered sequence of immutable key-value sets, to any one child node of the node, the key-value pair comprising one key and one value, the one key being unique in the kvset, the kvset storing multiple key-value pairs, the determinative mapping providing a rule such that the key-value pair maps to a specific path through the tree to a specific child node at any level of the tree without regard to node content of the tree; and writing the kvset to a sequence of kvsets of a root-node of the tree. - View Dependent Claims (36, 37, 38, 39, 40, 41, 42)
-
-
43. A system comprising:
-
means for receiving a key-value set (kvset) to store in a key-value data structure, organized as a tree on at least one non-transitory machine readable medium, the kvset comprising a mapping of unique keys to values, the keys and the values of the kvset being immutable, a node of the tree comprising; a temporally ordered sequence of kvsets with key-value pairs with keys that determinatively map to the nodes, the temporally ordered sequence comprising an oldest kvset at one end of the temporally ordered sequence and a newest kvset at another end of the temporally ordered sequence; and a determinative mapping for a key-value pair in a kvset of the temporally ordered sequence of immutable key-value sets, to any one child node of the node, the key-value pair comprising one key and one value, the one key being unique in the kvset, the kvset storing multiple key-value pairs, the determinative mapping providing a rule such that any key-value pair maps to a specific path through the tree to a specific child node at any level of the tree without regard to node content of the tree; and means for writing the kvset to a sequence of kvsets of a root-node of the tree. - View Dependent Claims (44, 45)
-
Specification