Loading...
Efficient Bulk Operations on Dynamic R-trees
Arge, Lars Hinrichs, Klaus H. Vahrenhold, Jan Vitter, Jeffrey Scott
Arge, Lars
Hinrichs, Klaus H.
Vahrenhold, Jan
Vitter, Jeffrey Scott
Citations
Altmetric:
Abstract
In recent years, there has been an upsurge of interest in spatial databases. A major
issue is how to efficiently manipulate massive amounts of spatial data stored on disk
in multidimensional spatial indexes (data structures). Construction of spatial indexes
(bulk loading) has been studied intensively in the database community. The continuous
arrival of massive amounts of new data makes it important to e ciently update existing
indexes (bulk updating).
In this paper, we present a simple, yet e cient technique for performing bulk update
and query operations on multidimensional indexes. We present our technique in terms
of the so-called R-tree and its variants, as they have emerged as practically e cient
indexing methods for spatial data. Our method uses ideas from the bu er tree lazy
bu ering technique and fully utilizes the available internal memory and the page size of
the operating system. We give a theoretical analysis of our technique, showing that it
is e cient both in terms of I/O communication, disk storage, and internal computation
time. We also present the results of an extensive set of experiments showing that in
practice our approach performs better than the previously best known bulk update
methods with respect to update time, and that it produces a better quality index in
terms of query performance. One important novel feature of our technique is that in
most cases it allows us to perform a batch of updates and queries simultaneously. To
be able to do so is essential in environments where queries have to be answered even
while the index is being updated and reorganized.
Description
The original publication is available at www.springerlink.com
Date
2002-12
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
L. Arge, K. H. Hinrichs, J. Vahrenhold, and J. S. Vitter. “Efficient Bulk Operations on Dynamic R-trees,” special issue on experimental algorithmics in Algorithmica, 33(1), May 2002, 104–128. An extended abstract appears in Proceedings of the 1st Workshop on Algorithm Engineering and Experimentation (ALENEX ’99), Baltimore, MD, January 1999, 328–348. http://dx.doi.org/10.1007/s00453-001-0107-6