Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
DOI: 10.1007/s00453-001-0107-6 Algorithmica (2002) 33: 104128
 

Summary: DOI: 10.1007/s00453-001-0107-6
Algorithmica (2002) 33: 104128
Algorithmica
2002 Springer-Verlag New York Inc.
Efficient Bulk Operations on Dynamic R-Trees1
L. Arge,2
K. H. Hinrichs,3
J. Vahrenhold,3
and J. S. Vitter2
Abstract. 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 terms of
I/O communication, disk storage, and internal computation time. We also present the results of an extensive

  

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

 

Collections: Computer Technologies and Information Sciences