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
82
Implementation techniques for main memory database systems
David J. DeWitt, Randy H. Katz, Frank Olken et al. · 1984 · 818 citations · Full text
An asymptotically optimal multiversion B-tree
Bruno Becker, Stephan Gschwind, Thomas Ohler et al. · The VLDB Journal · 1996 · 386 citations
Making B+- trees cache conscious in main memory
Jun Rao, Kenneth A. Ross · ACM SIGMOD Record · 2000 · 378 citations · Full text
Scalability in the XFS file system
Adam R. Sweeney, Doug Doucette, Wei Hu et al. · 1996 · 370 citations
1–5 of 82
203
5
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 203
74
University of California, Berkeley
Berkeley, United States
5 h-index
12 publications
4K citations
National University of Singapore
Singapore, Singapore
5 h-index
15 publications
1.1K citations

Lawrence Berkeley National Laboratory
Berkeley, United States
4 h-index
4 publications
1.1K citations
IBM (United States)
Armonk, United States
4 h-index
6 publications
1K citations
Northeastern University
Boston, United States
4 h-index
6 publications
241 citations

University of Waterloo
Waterloo, Canada
4 h-index
7 publications
235 citations

Pennsylvania State University
State College, United States
3 h-index
5 publications
207 citations

Dakota State University
Madison, United States
3 h-index
3 publications
1K citations
1–8 of 74
9 publications · 675 citations
9
h-index
PVLDB · 7 publications · 517 citations
7
h-index
Conference · 4 publications · 210 citations
4
h-index
DKE · 2 publications · 74 citations
2
h-index
2 publications · 42 citations
2
h-index
1–5