Cache-oblivious B-trees

By M. A. Bender, Erik D. Demaine, Martín Farach-Colton. Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000

345 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/d008d53d1c357cf11ff1000b33a9e2485d3b05c2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. J. Demmel
2. R. Vuduc
3. Jeffrey Scott Vitter
4. K. Yelick
5. Amol Deshpande
6. Prithviraj Sen

In Computer Networks and Communications

1. J. Demmel
2. R. Vuduc
3. Jeffrey Scott Vitter
4. K. Yelick
5. Amol Deshpande
6. Prithviraj Sen

Citations in the corpus

• External memory algorithms and data structures: dealing with massive data (2001, methodology): “The dynamic data structure for threesided range searching can be generalized using the filtering technique of Chazelle [1986] to handle general foursided queries with optimal I/O query bound O(logB N + z) and optimal disk space usage O(n(log n)/ log(logB N + 1)) [Arge et al.”
• Automatic performance tuning of sparse matrix kernels (2003, methodology): “Their library, (8)Cache-oblivious algorithms have been developed for a variety of other contexts as well, such as fast tree, priority queue, and graph algorithms [17, 36, 58].”