Key-independent optimality

John Iacono

    Research output: Contribution to journalArticle

    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)
    Pages (from-to)3-10
    Number of pages8
    JournalAlgorithmica (New York)
    Volume42
    Issue number1
    DOIs
    StatePublished - Mar 2005

    Fingerprint

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

    Keywords

    • Data structures
    • Dictionary
    • Splay tree

    ASJC Scopus subject areas

    • Computer Graphics and Computer-Aided Design
    • Software
    • Safety, Risk, Reliability and Quality
    • Applied Mathematics

    Cite this

    Key-independent optimality. / Iacono, John.

    In: Algorithmica (New York), Vol. 42, No. 1, 03.2005, p. 3-10.

    Research output: Contribution to journalArticle

    Iacono, John. / Key-independent optimality. In: Algorithmica (New York). 2005 ; Vol. 42, No. 1. pp. 3-10.
    @article{73e5adc6999d4ae8a418e43ec350a174,
    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.",
    keywords = "Data structures, Dictionary, Splay tree",
    author = "John Iacono",
    year = "2005",
    month = "3",
    doi = "10.1007/s00453-004-1136-8",
    language = "English (US)",
    volume = "42",
    pages = "3--10",
    journal = "Algorithmica",
    issn = "0178-4617",
    publisher = "Springer New York",
    number = "1",

    }

    TY - JOUR

    T1 - Key-independent optimality

    AU - Iacono, John

    PY - 2005/3

    Y1 - 2005/3

    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.

    KW - Data structures

    KW - Dictionary

    KW - Splay tree

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

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

    U2 - 10.1007/s00453-004-1136-8

    DO - 10.1007/s00453-004-1136-8

    M3 - Article

    VL - 42

    SP - 3

    EP - 10

    JO - Algorithmica

    JF - Algorithmica

    SN - 0178-4617

    IS - 1

    ER -