Append-Only B-Tree Cursor

摘要

Existing algorithms to build balanced tree structures (“b-trees”) compare a data element. (e.g., a key) to be inserted with the data elements that have already been inserted to find the correct position to insert the data element. Additionally, the algorithms balance and/or rebalance the b-tree when any individual node gets over-filled. As part of this balancing, data elements stored in the various nodes are moved to other nodes. These operations can incur both time and resource costs. We propose an algorithm to build a b-tree in a bottom up manner and a technique to modify trees built using the aforementioned algorithm so that they are balanced. We also propose a method to allow for adding more data into the thus-built b-tree as long as it follows a certain set of pre-conditions.

主权项

1. A method, comprising:
receiving, by a controller, a data element for storage in a b-tree, wherein the data element is part of an ordered set of data elements; determining, by the controller, that a first node in the b-tree is filled to capacity; storing, by the controller, the data element in a parent node of the first node; associating, by the controller, a second node with the parent node; and storing, by the controller, a subsequent data element in the second node.