The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Algorithms for loading parallel grid files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Bulk-insertions into R-trees using the small-tree-large-tree approach
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Bulk-Loading of Gridfiles
IEEE Transactions on Knowledge and Data Engineering
Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Cost Model for Estimating the Performance of Spatial Joins Using R-trees
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Efficient Bulk Operations on Dynamic R-trees
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
New Linear Node Splitting Algorithm for R-trees
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Improving Spatial Intersect Joins Using Symbolic Intersect Detection
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Clustering for Approximate Similarity Search in High-Dimensional Spaces
IEEE Transactions on Knowledge and Data Engineering
Revisiting R-Tree Construction Principles
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Batched Processing for Information Filters
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
Bulk insertion for R-trees by seeded clustering
Data & Knowledge Engineering
Buffering accesses to memory-resident index structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Improving performance with bulk-inserts in Oracle R-trees
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Query Responsive Index Structures
GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Towards efficient main-memory use for optimum tree index update
Proceedings of the VLDB Endowment
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
Bulk construction of dynamic clustered metric trees
Knowledge and Information Systems
Historical index structure for reducing insertion and search cost in LBS
Journal of Systems and Software
A ONCE-updating approach on moving objects
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
Scalable continuous query processing and moving object indexing in spatio-temporal databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
A lot of recent work has studied strategies related to bulk loading of large data sets into multidimensional index structures. In this paper, we address the problem of bulk insertions into existing index structures with particular focus on R-trees - which are an important class of index structures used widely in commercial database systems. We propose a new technique, which as opposed to the current technique of inserting data one by one, bulk inserts entire new incoming datasets into an active R-tree. This technique, called GBI (for Generalized Bulk Insertion), partitions the new datasets into sets of clusters and outliers, constructs an R-tree (small tree) from each cluster, identifies and prepares suitable locations in the original R-tree (large tree) for insertion, and lastly performs the insertions of the small trees and the outliers into the large tree in bulk. Our experimental studies demonstrate that GBI does especially well (over 200% better than the existing technique) for randomly located data as well as for real datasets that contain few natural clusters, while also consistently outperforming the alternate technique in all other circumstances.