Worst-Case Optimal Tree Layout in External Memory

Erik D. Demaine, John Iacono, Stefan Langerman

    Research output: Contribution to journalArticle

    Abstract

    Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is (Formula Presented.)

    Original languageEnglish (US)
    Pages (from-to)369-378
    Number of pages10
    JournalAlgorithmica (New York)
    Volume72
    Issue number2
    DOIs
    StatePublished - Jun 1 2015

    Fingerprint

    External Memory
    Layout
    Data storage equipment
    Binary Tree
    Vertex of a graph
    Binary trees
    Roots
    Topology
    Minimise
    Path

    Keywords

    • Data structures
    • External-memory
    • Trees

    ASJC Scopus subject areas

    • Computer Science(all)
    • Computer Science Applications
    • Applied Mathematics

    Cite this

    Worst-Case Optimal Tree Layout in External Memory. / Demaine, Erik D.; Iacono, John; Langerman, Stefan.

    In: Algorithmica (New York), Vol. 72, No. 2, 01.06.2015, p. 369-378.

    Research output: Contribution to journalArticle

    Demaine, ED, Iacono, J & Langerman, S 2015, 'Worst-Case Optimal Tree Layout in External Memory', Algorithmica (New York), vol. 72, no. 2, pp. 369-378. https://doi.org/10.1007/s00453-013-9856-2
    Demaine, Erik D. ; Iacono, John ; Langerman, Stefan. / Worst-Case Optimal Tree Layout in External Memory. In: Algorithmica (New York). 2015 ; Vol. 72, No. 2. pp. 369-378.
    @article{776757d1a2da498f9bead0e2475932ce,
    title = "Worst-Case Optimal Tree Layout in External Memory",
    abstract = "Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is (Formula Presented.)",
    keywords = "Data structures, External-memory, Trees",
    author = "Demaine, {Erik D.} and John Iacono and Stefan Langerman",
    year = "2015",
    month = "6",
    day = "1",
    doi = "10.1007/s00453-013-9856-2",
    language = "English (US)",
    volume = "72",
    pages = "369--378",
    journal = "Algorithmica",
    issn = "0178-4617",
    publisher = "Springer New York",
    number = "2",

    }

    TY - JOUR

    T1 - Worst-Case Optimal Tree Layout in External Memory

    AU - Demaine, Erik D.

    AU - Iacono, John

    AU - Langerman, Stefan

    PY - 2015/6/1

    Y1 - 2015/6/1

    N2 - Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is (Formula Presented.)

    AB - Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is (Formula Presented.)

    KW - Data structures

    KW - External-memory

    KW - Trees

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

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

    U2 - 10.1007/s00453-013-9856-2

    DO - 10.1007/s00453-013-9856-2

    M3 - Article

    AN - SCOPUS:84929061198

    VL - 72

    SP - 369

    EP - 378

    JO - Algorithmica

    JF - Algorithmica

    SN - 0178-4617

    IS - 2

    ER -