Improving performance with bulk-inserts in Oracle R-trees

Authors:
Ning An;Ravi Kanth;V. Kothuri;Siva Ravada
Affiliations:
Spatial Technologies, Oracle Corporation, Nashua, New Hampshire;Spatial Technologies, Oracle Corporation, Nashua, New Hampshire;Spatial Technologies, Oracle Corporation, Nashua, New Hampshire;Spatial Technologies, Oracle Corporation, Nashua, New Hampshire
Venue:
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Year:
2003

Citing 6
Cited 7

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
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
A greedy algorithm for bulk loading R-trees

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Indexing medium-dimensionality data in Oracle

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
GBI: A Generalized R-Tree Bulk-Insertion Strategy

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases

Incorporating Updates in Domain Indexes: Experiences with Oracle Spatial R-trees

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Bulk Operations for Space-Partitioning Trees

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A novel improvement to the R*-tree spatial index using gain/loss metrics

Proceedings of the 12th annual ACM international workshop on Geographic information systems
Improving the R*-tree with outlier handling techniques

Proceedings of the 13th annual ACM international workshop on Geographic information systems
The hB-pi* Tree: An Optimized Comprehensive Access Method for Frequent-Update Multi-dimensional Point Data

SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Historical index structure for reducing insertion and search cost in LBS

Journal of Systems and Software
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spatial indexes play a major role in fast access to spatial and location data. Most commercial applications insert new data in bulk: in batches or arrays. In this paper, we propose a novel bulk insertion technique for R-Trees that is fast and does not compromise on the quality of the resulting index. We present our experiences with incorporating the proposed bulk insertion strategies into Oracle 10i. Experiments with real datasets show that our bulk insertion strategy improves performance of insert operations by 50%-90%.