B-trees

B-Trees is a balanced tree data structure designed for external memory that maintains sorted data and supports efficient search, insertion, and deletion operations by allowing nodes to have multiple keys and children, thereby minimizing disk I/O in block-oriented storage systems.

357

Publications

25.3K

Citations

745

Authors

248

Institutions

Publications per year

2017–2026

48

Authors

745

  1. DL
    David Lomet

    Microsoft (United States), United States

    16 publications · 1.2K citations

    15

    h-index

  2. GG
    Goetz Graefe

    Hewlett-Packard (United States), United States

    13 publications · 910 citations

    12

    h-index

  3. BS
    Betty Salzberg

    Northeastern University, United States

    9 publications · 622 citations

    9

    h-index

  4. MF
    Martı́n Farach-Colton

    Rutgers, The State University of New Jersey, United States

    8 publications · 637 citations

    8

    h-index

  5. MA
    Michael A. Bender

    Stony Brook University, United States

    7 publications · 590 citations

    7

    h-index

1–5 of 745

Venues

  1. ACM SIGMOD Record

    22 publications · 1.1K citations

    17

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 21 publications · 1.4K citations

    17

    h-index

  3. ACM Transactions on Database Systems

    TODS · 17 publications · 1.8K citations

    15

    h-index

  4. Very Large Data Bases

    Conference · 12 publications · 795 citations

    11

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 8 publications · 293 citations

    8

    h-index

1–5