B+ Trees

B+ Trees is a balanced tree data structure in external memory that generalizes the B-tree by storing all data records exclusively in its leaf nodes while maintaining sorted keys in internal nodes to enable efficient range queries and sequential access.

82

Publications

6.1K

Citations

203

Authors

74

Institutions

Publications per year

2017–2026

14

Authors

203

  1. BC
    Beng Chin Ooi

    National University of Singapore, Singapore

    5 publications · 374 citations

    5

    h-index

  2. BS
    Betty Salzberg

    Northeastern University, United States

    4 publications · 166 citations

    4

    h-index

  3. FO
    Frank Olken

    Lawrence Berkeley National Laboratory, United States

    4 publications · 1.1K citations

    4

    h-index

  4. BS
    Bernhard Seeger

    Philipps University of Marburg, Germany

    4 publications · 452 citations

    4

    h-index

  5. DJ
    David J. DeWitt

    University of Wisconsin–Madison, United States

    3 publications · 1K citations

    3

    h-index

1–5 of 203

Venues

  1. ACM SIGMOD Record

    9 publications · 675 citations

    9

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 7 publications · 517 citations

    7

    h-index

  3. Very Large Data Bases

    Conference · 4 publications · 210 citations

    4

    h-index

  4. Data & Knowledge Engineering

    DKE · 2 publications · 74 citations

    2

    h-index

  5. Cluster Computing

    2 publications · 42 citations

    2

    h-index

1–5