The power and limitations of static binary search trees with lazy finger

Presenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Abstract

    A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed—where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree. A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings
    PublisherSpringer Verlag
    Pages181-192
    Number of pages12
    Volume8889
    ISBN (Print)9783319130743
    DOIs
    StatePublished - 2014

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8889
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Fingerprint

    Binary Search Tree
    Dynamic programming
    Entropy
    Roots
    Search Methods
    Dynamic Programming
    Optimality

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Bose, P., Douïeb, K., Iacono, J., & Langerman, S. (2014). The power and limitations of static binary search trees with lazy finger. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings (Vol. 8889, pp. 181-192). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889). Springer Verlag. https://doi.org/10.1007/978-3-319-13075-0_15

    The power and limitations of static binary search trees with lazy finger. / Bose, Presenjit; Douïeb, Karim; Iacono, John; Langerman, Stefan.

    Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Vol. 8889 Springer Verlag, 2014. p. 181-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8889).

    Research output: Chapter in Book/Report/Conference proceedingChapter

    Bose, P, Douïeb, K, Iacono, J & Langerman, S 2014, The power and limitations of static binary search trees with lazy finger. in Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. vol. 8889, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8889, Springer Verlag, pp. 181-192. https://doi.org/10.1007/978-3-319-13075-0_15
    Bose P, Douïeb K, Iacono J, Langerman S. The power and limitations of static binary search trees with lazy finger. In Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Vol. 8889. Springer Verlag. 2014. p. 181-192. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-13075-0_15
    Bose, Presenjit ; Douïeb, Karim ; Iacono, John ; Langerman, Stefan. / The power and limitations of static binary search trees with lazy finger. Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings. Vol. 8889 Springer Verlag, 2014. pp. 181-192 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inbook{f9ee7a92a3a344fd877fc7a0d7e1c2ca,
    title = "The power and limitations of static binary search trees with lazy finger",
    abstract = "A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed—where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree. A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.",
    author = "Presenjit Bose and Karim Dou{\"i}eb and John Iacono and Stefan Langerman",
    year = "2014",
    doi = "10.1007/978-3-319-13075-0_15",
    language = "English (US)",
    isbn = "9783319130743",
    volume = "8889",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "181--192",
    booktitle = "Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings",

    }

    TY - CHAP

    T1 - The power and limitations of static binary search trees with lazy finger

    AU - Bose, Presenjit

    AU - Douïeb, Karim

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2014

    Y1 - 2014

    N2 - A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed—where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree. A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.

    AB - A static binary search tree where every search starts from where the previous one ends (lazy finger) is considered. Such a search method is more powerful than that of the classic optimal static trees, where every search starts from the root (root finger), and less powerful than when rotations are allowed—where finding the best rotation based tree is the topic of the dynamic optimality conjecture of Sleator and Tarjan. The runtime of the classic root-finger tree can be expressed in terms of the entropy of the distribution of the searches, but we show that this is not the case for the optimal lazy finger tree. A non-entropy based asymptotically-tight expression for the runtime of the optimal lazy finger trees is derived, and a dynamic programming-based method is presented to compute the optimal tree.

    UR - http://www.scopus.com/inward/record.url?scp=84921802410&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84921802410&partnerID=8YFLogxK

    U2 - 10.1007/978-3-319-13075-0_15

    DO - 10.1007/978-3-319-13075-0_15

    M3 - Chapter

    SN - 9783319130743

    VL - 8889

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 181

    EP - 192

    BT - Algorithms and Computation - 25th International Symposium, ISAAC 2014, Proceedings

    PB - Springer Verlag

    ER -