Efficient bulk operations on dynamic \(R\)-trees

DOI10.1007/S00453-001-0107-6zbMath0994.68054OpenAlexW3139341974MaRDI QIDQ1601035

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

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

R-treeexternal memorybulk loadingbulk operationsI/O-efficient

Mathematics Subject Classification ID

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

Related Items (2)

Execution time analysis of a top-down R-tree construction algorithm ⋮ I/O-efficient point location using persistent B-trees

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