Buffer Trees

Buffer Trees is an external memory data structure that extends the B-tree model by incorporating buffered updates to batch and defer insertions and deletions, thereby optimizing I/O efficiency in external memory algorithms.

45

Publications

2.3K

Citations

149

Authors

69

Institutions

Publications per year

2017–2026

7

Authors

149

  1. MH
    Miloš Hrkić

    University of Illinois Chicago, United States

    3 publications · 75 citations

    3

    h-index

  2. LA
    Lars Arge

    Aarhus University, Denmark

    3 publications · 294 citations

    3

    h-index

  3. YC
    Yao‐Wen Chang

    National Taiwan University, Taiwan

    2 publications · 74 citations

    2

    h-index

  4. ML
    Michael L. Scott

    University of Rochester, United States

    2 publications · 76 citations

    2

    h-index

  5. HA
    Hrishikesh Amur

    Georgia Institute of Technology, United States

    2 publications · 32 citations

    2

    h-index

1–5 of 149

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 166 citations

    3

    h-index

  2. Algorithmica

    2 publications · 530 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 1 publications · 15 citations

    1

    h-index

  4. ACM Transactions on Storage

    TOS · 1 publications · 15 citations

    1

    h-index

  5. USENIX Annual Technical Conference

    Conference · 1 publications · 52 citations

    1

    h-index

1–5