Recent developments in linear quadtree-based geographic information systems
Image and Vision Computing
The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Improving text retrieval for the routing problem using latent semantic indexing
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Incremental updates of inverted lists for text document retrieval
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Integrating IR and RDBMS using cooperative indexing
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient concurrency control in multidimensional access methods
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Indexing medium-dimensionality data in Oracle
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Proceedings of the 2002 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
The TV-tree: an index structure for high-dimensional data
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Efficient Index Structures for String Databases
Proceedings of the 27th International Conference on Very Large Data Bases
High-Concurrency Locking in R-Trees
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Processing of Large Spatial Queries Using Interior Approximations
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Hardware acceleration for spatial selections and joins
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Indexing of Moving Objects for Location-Based Services
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Selective deferred index maintenance & concurrency control in integrated information systems
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
Supporting frequent updates in R-trees: a bottom-up approach
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient IR-style keyword search over relational databases
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
Integrated data management for mobile services in the real world
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Proceedings of the VLDB Endowment
Hi-index | 0.01 |
Much research has been devoted to scalable storage andretrieval techniques for domain databases such as spatial,text, xml and gene sequence data. Many efficient indexingtechniques have been developed in this context. Given theimprovement in the underlying technology, database applicationsare increasingly using domain data in transactionalsemantics. In this paper, we examine the issue of when duringthe lifetime of a transaction is it better to incorporateupdates in domain indexes. We present our experiences withR-tree indexes in Oracle.We examine two approaches for incorporating updatesin spatial R-tree indexes: the first at update time, and thesecond at commit time. The first approach immediatelyincorporates changes in the index right away using systemtransactions and at commit time makes them visibleto other transactions. The second approach, referred toas the deferred-incorporate approach, defers the updatesin a secondary table and incorporates the changes in theindex only at commit time. In experiments on real datasets, we compare the performance of the two approaches.For most transactions with reasonable number of updateoperations, we observe that the deferred approach outperformsthe immediate-incorporate approach significantlyfor update operations and with appropriate optimizationsachieves comparable query performance.