Key independent optimality

John Iacono

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

    Abstract

    A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings
    Pages25-31
    Number of pages7
    Volume2518 LNCS
    DOIs
    StatePublished - 2002
    Event13th Annual International Symposium on Algorithms and Computation, ISAAC 2002 - Vancouver, BC, Canada
    Duration: Nov 21 2002Nov 23 2002

    Publication series

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

    Other

    Other13th Annual International Symposium on Algorithms and Computation, ISAAC 2002
    CountryCanada
    CityVancouver, BC
    Period11/21/0211/23/02

    Fingerprint

    Glossaries
    Data structures
    Optimality
    Binary Search Tree
    Unordered
    Tree Algorithms
    Search Algorithm
    Assign
    Upper and Lower Bounds
    Multiplicative
    Data Structures

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Iacono, J. (2002). Key independent optimality. In Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings (Vol. 2518 LNCS, pp. 25-31). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2518 LNCS). https://doi.org/10.1007/3-540-36136-7_3

    Key independent optimality. / Iacono, John.

    Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings. Vol. 2518 LNCS 2002. p. 25-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2518 LNCS).

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

    Iacono, J 2002, Key independent optimality. in Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings. vol. 2518 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2518 LNCS, pp. 25-31, 13th Annual International Symposium on Algorithms and Computation, ISAAC 2002, Vancouver, BC, Canada, 11/21/02. https://doi.org/10.1007/3-540-36136-7_3
    Iacono J. Key independent optimality. In Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings. Vol. 2518 LNCS. 2002. p. 25-31. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-36136-7_3
    Iacono, John. / Key independent optimality. Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings. Vol. 2518 LNCS 2002. pp. 25-31 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{a69a66a312ed42739642b03929c721cb,
    title = "Key independent optimality",
    abstract = "A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.",
    author = "John Iacono",
    year = "2002",
    doi = "10.1007/3-540-36136-7_3",
    language = "English (US)",
    isbn = "3540001425",
    volume = "2518 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "25--31",
    booktitle = "Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings",

    }

    TY - GEN

    T1 - Key independent optimality

    AU - Iacono, John

    PY - 2002

    Y1 - 2002

    N2 - A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.

    AB - A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.

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

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

    U2 - 10.1007/3-540-36136-7_3

    DO - 10.1007/3-540-36136-7_3

    M3 - Conference contribution

    SN - 3540001425

    SN - 9783540001423

    VL - 2518 LNCS

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

    SP - 25

    EP - 31

    BT - Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings

    ER -