Merge tree modifications for maintenance operations
First Claim
Patent Images
1. A system comprising processing circuitry configured to perform operations comprising:
- receiving, by the processing circuitry, a request for a Key-Value Set (KVS) tree stored on non-transitory computer-readable media, the KVS tree being a data structure comprising nodes, a node of the KVS tree comprising a temporally ordered sequence of 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, each kvset storing keys in sorted order within the kvset;
receiving a parameter set for the KVS tree, the receiving of the parameter set being separate from the request; and
executing, by the processing circuitry, the request on the KVS tree by performing an operation of the KVS tree as modified in accordance with the parameter set.
5 Assignments
0 Petitions
Accused Products
Abstract
Systems and techniques for merge tree modifications for maintenance operations are described herein. A request for a KVS tree is received. Here, the KVS tree is a data structure including nodes and the nodes include a temporally ordered sequence of kvsets that store keys in sorted order. A parameter set for the KVS tree is received. The request is executed on the KVS tree by modifying operation of the KVS tree in accordance with the parameter.
61 Citations
42 Claims
-
1. A system comprising processing circuitry configured to perform operations comprising:
-
receiving, by the processing circuitry, a request for a Key-Value Set (KVS) tree stored on non-transitory computer-readable media, the KVS tree being a data structure comprising nodes, a node of the KVS tree comprising a temporally ordered sequence of 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, each kvset storing keys in sorted order within the kvset; receiving a parameter set for the KVS tree, the receiving of the parameter set being separate from the request; and executing, by the processing circuitry, the request on the KVS tree by performing an operation of the KVS tree as modified in accordance with the parameter set. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. At least one non-transitory machine readable medium comprising instruction that, when executed by a machine, cause the machine to perform operations comprising:
-
receiving, by processing circuitry of the machine, a request for a Key-Value Set (KVS) tree stored on non-transitory computer-readable media, the KVS tree being a data structure comprising nodes, a node of the KVS tree comprising a temporally ordered sequence of 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, each kvset storing keys in sorted order within the kvset; receiving a parameter set for the KVS tree, the receiving of the parameter set being separate from the request; and executing, by the processing circuitry of the machine, the request on the KVS tree by performing an operation of the KVS tree as modified in accordance with the parameter set. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30)
-
-
31. A machine-implemented method comprising:
-
receiving, by processing circuitry of a machine, a request for a Key-Value Set (KVS) tree stored on non-transitory computer-readable media, the KVS tree being a data structure comprising nodes, a node of the KVS tree comprising a temporally ordered sequence of 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, each kvset storing keys in sorted order within the kvset; receiving a parameter set for the KVS tree, the receiving of the parameter set being separate from the request; and executing, by the processing circuitry of the machine, the request on the KVS tree by performing an operation of the KVS tree as modified in accordance with the parameter set. - View Dependent Claims (32, 33, 34, 35, 36)
-
-
37. A system comprising:
-
means for receiving a request for a Key-Value Set (KVS) tree stored on non-transitory computer-readable media, the KVS tree being a data structure comprising nodes, a node of the KVS tree comprising a temporally ordered sequence of 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, each kvset storing keys in sorted order within the kvset; means for receiving a parameter set for the KVS tree the receiving of the parameter set being separate from the request; and means for executing the request on the KVS tree by performing an operation of the KVS tree as modified in accordance with the parameter set. - View Dependent Claims (38, 39, 40, 41, 42)
-
Specification