Bulk-insertions into R-trees using the small-tree-large-tree approach

Previous work on brdk loading data focussed at building multidimensional index structures jkam scratcl+ while the probIem of bdk insertions into esisting index structures has been largely overlooked. In this paper, we now propme the STLT (Srnall-Tr~Laxge-Tree) technique, which as opposed to the cument technique of inserting data one by cm% bulk inserts entire new datasets into an active R-tree. STLT considers the new dataset as an R-tree itself (small tree), identifies and prepares a suitable location in the original R-tree (large tree) for insertio~ and lastly performs the insert of the small tree into the large tree. Our experiments confirm that for skewed dahsets STLT consistently outperforms existing techniques (by up to 65%) for data insertion, -whilegenerating an index structure with comparable query retrieval performance. Key-wor& Multidimensional Index Structures, Bulk-loading, Bulk-inwtion, Spatial Databases.

[1]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[2]  Elke A. Rundensteiner,et al.  Bulk-Insertions into R-Trees , 1998 .

[3]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[4]  Elke A. Rundensteiner,et al.  A cost model for estimating the performance of spatial joins using R-trees , 1997, Proceedings. Ninth International Conference on Scientific and Statistical Database Management (Cat. No.97TB100150).

[5]  Elke A. Rundensteiner,et al.  Integrated query processing strategies for spatial path queries , 1997, Proceedings 13th International Conference on Data Engineering.

[6]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[7]  Elke A. Rundensteiner,et al.  Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations , 1997, VLDB.

[8]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .