Efficient bulk operations on dynamic R-trees

DOI10.1007/S00453-001-0107-6MaRDI QIDQ1601035zbMATH OpenOpenAlexFDO

Authors Lars Arge, Jeffrey Scott Vitter, Klaus Hinrichs, Jan Vahrenhold

Publication date 17 June 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0107-6

zbMATH Keywords

bulk loadingbulk operationsexternal memoryI/O-efficientR-tree

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1870076
• R-trees: theory and applications
• scientific article; zbMATH DE number 1961032
• Algorithms for improving the quality of \(R\)-trees
• On R-trees with low query complexity

Cited in

(14)

• Box-trees and R-trees with near-optimal query time
• On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
• The study of multidimensional R-tree-based index scalability in multicore environment
• scientific article; zbMATH DE number 1304040 (Why is no real title available?)
• scientific article; zbMATH DE number 1951565 (Why is no real title available?)
• scientific article; zbMATH DE number 1961032 (Why is no real title available?)
• scientific article; zbMATH DE number 1870076 (Why is no real title available?)
• scientific article; zbMATH DE number 850290 (Why is no real title available?)
• scientific article; zbMATH DE number 2203878 (Why is no real title available?)
• Box-trees and R-trees with near-optimal query time
• Cache-oblivious R-trees
• I/O-efficient point location using persistent B-trees
• Computational Science – ICCS 2005
• Execution time analysis of a top-down R-tree construction algorithm

This page was built for publication: Efficient bulk operations on dynamic \(R\)-trees

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