KVS tree

  • US 10,725,988 B2
  • Filed: 02/09/2017
  • Issued: 07/28/2020
  • Est. Priority Date: 02/09/2017
  • Status: Active Grant
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.

View all claims
    ×
    ×

    Thank you for your feedback

    ×
    ×