Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Efficient Bulk Operations on Dynamic Rtrees (Extended Abstract)

Summary: Efficient Bulk Operations on Dynamic R­trees
(Extended Abstract)
Lars Arge 1? , Klaus H. Hinrichs 2 , Jan Vahrenhold 2?? , and Jeffrey S. Vitter 1? ? ?
1 Center for Geometric Computing, Department of Computer Science,
Duke University, Durham, NC 27708, USA.
large@cs.duke.edu, jsv@cs.duke.edu
2 Westf¨alische Wilhelms­Universit¨at, Institut f¨ur Informatik,
48149 M¨unster, Germany.
khh@math.uni­muenster.de, jan@math.uni­muenster.de
Abstract. We present a simple lazy buffering technique for performing
bulk operations on multidimensional spatial indexes (data structures),
and show that it is efficient in theory as well as in practice. We present
the technique in terms of the so­called R­tree and its variants, as they
have emerged as practically efficient indexing methods for spatial data.
1 Introduction
In recent years there has been an upsurge of interest in spatial databases in the
commercial and research database communities. Spatial databases are systems
designed to store, manage, and manipulate spatial data like points, polylines,
polygons, and surfaces. Geographic information systems (GIS) are a popular in­
carnation. Spatial database applications often involve massive data sets, such as


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


Collections: Computer Technologies and Information Sciences