Sciweavers

Share
ALGORITHMICA
2002

Efficient Bulk Operations on Dynamic R-Trees

8 years 6 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently 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 update existing indexes (bulk updating) efficiently. In this paper we present a simple, yet efficient, 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 efficient indexing methods for spatial data. Our method uses ideas from the buffer tree lazy buffering 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 efficient both in ter...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2002
Where ALGORITHMICA
Authors Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey Scott Vitter
Comments (0)
books