Combining binary search trees

Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any "well-behaved" bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is O(log log n) competitive, satisfies the working set bound (and thus satisfies the static finger bound and the static optimality bound), satisfies the dynamic finger bound, satisfies the unified bound with an additive O(log log n) factor, and performs each access in worst-case O(log n) time.

    Original languageEnglish (US)
    Title of host publicationAutomata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings
    Pages388-399
    Number of pages12
    Volume7965 LNCS
    EditionPART 1
    DOIs
    StatePublished - 2013
    Event40th International Colloquium on Automata, Languages, and Programming, ICALP 2013 - Riga, Latvia
    Duration: Jul 8 2013Jul 12 2013

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    NumberPART 1
    Volume7965 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
    CountryLatvia
    CityRiga
    Period7/8/137/12/13

    Fingerprint

    Binary Search Tree
    Data structures
    Data Structures
    Tree Structure
    Subsequence
    Optimality
    Closure

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Demaine, E. D., Iacono, J., Langerman, S., & Özkan, Ö. (2013). Combining binary search trees. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings (PART 1 ed., Vol. 7965 LNCS, pp. 388-399). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7965 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-39206-1_33

    Combining binary search trees. / Demaine, Erik D.; Iacono, John; Langerman, Stefan; Özkan, Özgür.

    Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. Vol. 7965 LNCS PART 1. ed. 2013. p. 388-399 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7965 LNCS, No. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Demaine, ED, Iacono, J, Langerman, S & Özkan, Ö 2013, Combining binary search trees. in Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 edn, vol. 7965 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 7965 LNCS, pp. 388-399, 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013, Riga, Latvia, 7/8/13. https://doi.org/10.1007/978-3-642-39206-1_33
    Demaine ED, Iacono J, Langerman S, Özkan Ö. Combining binary search trees. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. Vol. 7965 LNCS. 2013. p. 388-399. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-39206-1_33
    Demaine, Erik D. ; Iacono, John ; Langerman, Stefan ; Özkan, Özgür. / Combining binary search trees. Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. Vol. 7965 LNCS PART 1. ed. 2013. pp. 388-399 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
    @inproceedings{9d8ce07b831f4f73b3fb2c07427044df,
    title = "Combining binary search trees",
    abstract = "We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any {"}well-behaved{"} bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is O(log log n) competitive, satisfies the working set bound (and thus satisfies the static finger bound and the static optimality bound), satisfies the dynamic finger bound, satisfies the unified bound with an additive O(log log n) factor, and performs each access in worst-case O(log n) time.",
    author = "Demaine, {Erik D.} and John Iacono and Stefan Langerman and {\"O}zg{\"u}r {\"O}zkan",
    year = "2013",
    doi = "10.1007/978-3-642-39206-1_33",
    language = "English (US)",
    isbn = "9783642392054",
    volume = "7965 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    number = "PART 1",
    pages = "388--399",
    booktitle = "Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings",
    edition = "PART 1",

    }

    TY - GEN

    T1 - Combining binary search trees

    AU - Demaine, Erik D.

    AU - Iacono, John

    AU - Langerman, Stefan

    AU - Özkan, Özgür

    PY - 2013

    Y1 - 2013

    N2 - We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any "well-behaved" bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is O(log log n) competitive, satisfies the working set bound (and thus satisfies the static finger bound and the static optimality bound), satisfies the dynamic finger bound, satisfies the unified bound with an additive O(log log n) factor, and performs each access in worst-case O(log n) time.

    AB - We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any "well-behaved" bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is O(log log n) competitive, satisfies the working set bound (and thus satisfies the static finger bound and the static optimality bound), satisfies the dynamic finger bound, satisfies the unified bound with an additive O(log log n) factor, and performs each access in worst-case O(log n) time.

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

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

    U2 - 10.1007/978-3-642-39206-1_33

    DO - 10.1007/978-3-642-39206-1_33

    M3 - Conference contribution

    AN - SCOPUS:84880317052

    SN - 9783642392054

    VL - 7965 LNCS

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

    SP - 388

    EP - 399

    BT - Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings

    ER -