B-tree Indexing

B-Tree Indexing is a hierarchical, balanced tree-based data indexing method that enables efficient logarithmic-time insertion, deletion, and search operations in storage engines by maintaining sorted data across fixed-size pages with a branching factor optimized for block-oriented storage systems.

251

Publications

15.9K

Citations

535

Authors

194

Institutions

Publications per year

2017–2026

36

Authors

535

  1. DL
    David Lomet

    Microsoft (United States), United States

    18 publications · 1.2K citations

    17

    h-index

  2. BS
    Betty Salzberg

    Northeastern University, United States

    10 publications · 910 citations

    10

    h-index

  3. BC
    Beng Chin Ooi

    National University of Singapore, Singapore

    9 publications · 509 citations

    9

    h-index

  4. GG
    Goetz Graefe

    Hewlett-Packard (United States), United States

    8 publications · 636 citations

    8

    h-index

  5. CM
    C. Mohan

    IBM Research - Almaden, United States

    7 publications · 609 citations

    7

    h-index

1–5 of 535

Venues

  1. ACM SIGMOD Record

    18 publications · 1.2K citations

    15

    h-index

  2. Proceedings of the VLDB Endowment

    PVLDB · 16 publications · 1K citations

    14

    h-index

  3. ACM Transactions on Database Systems

    TODS · 11 publications · 1.2K citations

    11

    h-index

  4. Very Large Data Bases

    Conference · 9 publications · 347 citations

    9

    h-index

  5. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 6 publications · 219 citations

    6

    h-index

1–5