Cache-oblivious r-trees

Lars Arge, Mark de Berg, Herman J. Haverkort. Cache-oblivious r-trees. In Joseph S. B. Mitchell, Günter Rote, editors, Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005. pages 170-179, ACM, 2005. [doi]

@inproceedings{ArgeBH05,
  title = {Cache-oblivious r-trees},
  author = {Lars Arge and Mark de Berg and Herman J. Haverkort},
  year = {2005},
  doi = {10.1145/1064092.1064120},
  url = {http://doi.acm.org/10.1145/1064092.1064120},
  tags = {caching},
  researchr = {https://researchr.org/publication/ArgeBH05},
  cites = {0},
  citedby = {0},
  pages = {170-179},
  booktitle = {Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005},
  editor = {Joseph S. B. Mitchell and Günter Rote},
  publisher = {ACM},
  isbn = {1-58113-991-8},
}