Competitive Online Search Trees on Trees

08/02/2019
by   Prosenjit Bose, et al.
0

We consider the design of adaptive data structures for searching elements of a tree-structured space. We use a natural generalization of the rotation-based online binary search tree model in which the underlying search space is the set of vertices of a tree. This model is based on a simple structure for decomposing graphs, previously known under several names including elimination trees, vertex rankings, and tubings. The model is equivalent to the classical binary search tree model exactly when the underlying tree is a path. We describe an online O( n)-competitive search tree data structure in this model, matching the best known competitive ratio of binary search trees. Our method is inspired by Tango trees, an online binary search tree algorithm, but critically needs several new notions including one which we call Steiner-closed search trees, which may be of independent interest. Moreover our technique is based on a novel use of two levels of decomposition, first from search space to a set of Steiner-closed trees, and secondly from these trees into paths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/03/2018

Weighted dynamic finger in binary search trees

It is shown that the online binary search tree data structure GreedyASS ...
research
06/09/2015

Self Organizing Maps Whose Topologies Can Be Learned With Adaptive Binary Search Trees Using Conditional Rotations

Numerous variants of Self-Organizing Maps (SOMs) have been proposed in t...
research
06/07/2021

Deterministic Iteratively Built KD-Tree with KNN Search for Exact Applications

K-Nearest Neighbors (KNN) search is a fundamental algorithm in artificia...
research
12/26/2020

Arithmetic Binary Search Trees: Static Optimality in the Matching Model

Motivated by recent developments in optical switching and reconfigurable...
research
10/02/2020

Splay trees on trees

Search trees on trees (STTs) are a far-reaching generalization of binary...
research
02/06/2019

Firefighting on Trees

In the Firefighter problem, introduced by Hartnell in 1995, a fire sprea...
research
06/28/2021

Experimental Comparison of PC-Trees and PQ-Trees

PQ-trees and PC-trees are data structures that represent sets of linear ...

Please sign up or login with your details

Forgot password? Click here to reset