Buffer Trees
Buffer Trees is an external memory data structure that extends the B-tree model by incorporating buffered updates to batch and defer insertions and deletions, thereby optimizing I/O efficiency in external memory algorithms.
45
Publications
2.3K
Citations
149
Authors
69
Institutions
Publications per year
2017–2026
7
45
Signals and memory in tree-ring width and density data
Jan Esper, Lea Schneider, Jason E. Smerdon et al. · Dendrochronologia · 2015 · 195 citations · Full text
Devesh Agrawal, Deepak Ganesan, Ramesh K. Sitaraman et al. · Proceedings of the VLDB Endowment · 2009 · 132 citations
1–5 of 45
149
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 149
69
University of Illinois Chicago
Chicago, United States
3 h-index
5 publications
126 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
6 publications
100 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
63 citations
Duke University
Durham, United States
2 h-index
2 publications
195 citations
University of Science and Technology of China
Hefei, China
2 h-index
7 publications
401 citations

University of Rochester
Rochester, United States
2 h-index
10 publications
332 citations
Tsinghua University
Beijing, China
2 h-index
9 publications
220 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
3 publications
723 citations
1–8 of 69
PVLDB · 3 publications · 166 citations
3
h-index
2 publications · 530 citations
2
h-index
Repository · 1 publications · 15 citations
1
h-index
TOS · 1 publications · 15 citations
1
h-index
Conference · 1 publications · 52 citations
1
h-index
1–5