Cache-oblivious R-trees

DOI10.1007/S00453-007-9007-8MaRDI QIDQ1017905zbMATH OpenOpenAlexFDO

Authors Lars Arge, Mark de Berg, Herman 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

cache-oblivious data structuresgeometric data structuresI/O-efficiencyR-trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Cache-oblivious R-trees
• Cache-oblivious data structures for orthogonal range searching
• Cache-oblivious planar orthogonal range searching and counting
• scientific article; zbMATH DE number 1670656
• On R-trees with low query complexity

Cites work

• Box-trees and R-trees with near-optimal query time
• Cache-oblivious algorithms
• Cache-Oblivious B-Trees
• Cache-oblivious data structures for orthogonal range searching
• Cache-oblivious priority queue and graph algorithm applications
• Decomposable searching problems
• scientific article; zbMATH DE number 3653523 (Why is no real title available?)
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1979501 (Why is no real title available?)
• scientific article; zbMATH DE number 1754589 (Why is no real title available?)
• scientific article; zbMATH DE number 2086622 (Why is no real title available?)
• scientific article; zbMATH DE number 1848393 (Why is no real title available?)
• scientific article; zbMATH DE number 2119641 (Why is no real title available?)
• scientific article; zbMATH DE number 2119642 (Why is no real title available?)
• I/O-efficient dynamic planar point location
• Organization and maintenance of large ordered indexes
• R-trees: theory and applications
• The priority R-tree: a practically efficient and worst-case optimal R-tree

Cited in

(6)

• Box-trees and R-trees with near-optimal query time
• On R-trees with low query complexity
• scientific article; zbMATH DE number 1670656 (Why is no real title available?)
• B-Trees and Cache-Oblivious B-Trees with Different-Sized Atomic Keys
• Box-trees and R-trees with near-optimal query time
• Cache-oblivious R-trees

This page was built for publication: Cache-oblivious R-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017905)