Cache-oblivious R-trees

DOI10.1007/s00453-007-9007-8zbMath1167.68017OpenAlexW2146529252MaRDI QIDQ1017905

Lars Arge, Mark T. de Berg, Herman J. Haverkort

Publication date: 13 May 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9007-8

zbMATH Keywords

geometric data structuresR-treescache-oblivious data structuresI/O-efficiency

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposable searching problems
• R-trees: theory and applications
• Box-trees and R-trees with near-optimal query time
• I/O-efficient dynamic planar point location
• Organization and maintenance of large ordered indexes
• Cache-Oblivious Algorithms
• Cache-oblivious priority queue and graph algorithm applications
• The priority R-tree
• Cache-oblivious data structures for orthogonal range searching
• Cache-Oblivious B-Trees