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
357
C-store: a column-oriented DBMS
Mike Stonebraker, Daniel J. Abadi, Adam Batkin et al. · 2005 · 928 citations
John T. Robinson · 1981 · 888 citations · Full text
Implementation techniques for main memory database systems
David J. DeWitt, Randy H. Katz, Frank Olken et al. · 1984 · 818 citations · Full text
Yun-Chih Chang, Yao‐Wen Chang, Guangming Wu et al. · 2000 · 544 citations · Full text
1–5 of 357
745
15
h-index
12
h-index
9
h-index
Rutgers, The State University of New Jersey, United States
8 publications · 637 citations
8
h-index
7
h-index
1–5 of 745
248
Carnegie Mellon University
Pittsburgh, United States
13 h-index
21 publications
3.3K citations

University of Waterloo
Waterloo, Canada
13 h-index
21 publications
905 citations
IBM (United States)
Armonk, United States
13 h-index
22 publications
2.7K citations
Hewlett-Packard (United States)
Palo Alto, United States
12 h-index
15 publications
1.6K citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
11 h-index
17 publications
1K citations
University of California, Berkeley
Berkeley, United States
9 h-index
18 publications
3.7K citations
National University of Singapore
Singapore, Singapore
8 h-index
22 publications
1.2K citations
Northeastern University
Boston, United States
8 h-index
12 publications
725 citations
1–8 of 248
22 publications · 1.1K citations
17
h-index
PVLDB · 21 publications · 1.4K citations
17
h-index
TODS · 17 publications · 1.8K citations
15
h-index
Conference · 12 publications · 795 citations
11
h-index
TKDE · 8 publications · 293 citations
8
h-index
1–5