Efficient bulk operations on dynamic R-trees

DOI10.1007/S00453-001-0107-6zbMATH Open0994.68054OpenAlexW3139341974MaRDI QIDQ1601035FDOQ1601035

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

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

zbMATH Keywords

external memoryR-treebulk loadingbulk operationsI/O-efficient

Mathematics Subject Classification ID

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

Cited In (13)

• On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Execution time analysis of a top-down R-tree construction algorithm
• Cache-oblivious R-trees
• Box-trees and R-trees with near-optimal query time
• Title not available (Why is that?)
• Computational Science – ICCS 2005
• Title not available (Why is that?)
• The study of multidimensional R-tree-based index scalability in multicore environment
• Box-trees and R-trees with near-optimal query time
• I/O-efficient point location using persistent B-trees

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)