Skip B-Trees

Range queries over skip tree graphs

“…A bucketing scheme [26] has been proposed to overcome this drawback. Skip B-trees [11] also extend skip graphs by combining them with B-trees. Their focus is on reducing nodes' state and providing a policy for assigning resources to nodes.…”

“…Skip tree graphs inherit the same problem as skip graph with respect to load balancing. Approaches similar to the ones designed to improve skip graphs [26,11] could be adapted for skip tree graph. Being based on skip trees, which are a concurrent approach to skip lists, it requires only local operations and provides a greater degree of concurrency than other balanced-tree based approaches.…”

“…B-trees, skip lists and skip trees are in the first group and AVL-trees are in the second group. Therefore, skip graphs [17], skip B-trees [11] and skip tree graphs are P2P versions lying on the first group, while BATON [19] and BATON * [20] can be included in the second group.…”

“…In order to meet this requirement, research to date has explored DHT-based solutions and overlay networks specifically built to provide a Distributed Search Tree functionality [11], i.e. the extension of DHT capabilities to support order-based and aggregation queries.…”

“…Systems not based on DHTs have designed overlay networks for which the order of the keys is preserved [16][17][18]11,19,20]. As hashing provides a solution to the dictionary problem, logical evolution has led to the consideration of other data structures that implement (ordered) dictionaries such as tries, 2-3 trees, B-trees, AVL trees, and skip lists.…”