We introduce a new O(lg lg n)-competitive binary search tree data structure called poketree that has the advantage of attaining, under worst-case analysis, O(lg n) cost per operation, including updates. Previous O(lg lg n)-competitive binary search tree data structures have not achieved O(lg n) worst-case cost per operation. A standard data structure such as red-black tree or deterministic skip list can be augmented with the dynamic links of a poketree to make it O(lg lg n)-competitive. Our approach also uses less memory per node than previous competitive data structures supporting updates. © 2006 Springer-Verlag Berlin/Heidelberg.
CITATION STYLE
Kujala, J., & Elomaa, T. (2006). Poketree: A dynamically competitive data structure with good worst-case performance. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 277–288). https://doi.org/10.1007/11940128_29
Mendeley helps you to discover research relevant for your work.