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
CIKM '93 Proceedings of the second international conference on Information and knowledge management
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
IEEE Transactions on Computers
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Revisiting R-Tree Construction Principles
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
IEEE Transactions on Knowledge and Data Engineering
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
B-tree indexes for high update rates
ACM SIGMOD Record
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
LUGrid: Update-tolerant Grid-based Indexing for Moving Objects
MDM '06 Proceedings of the 7th International Conference on Mobile Data Management
IMPACT: a twin-index framework for efficient moving object query processing
Data & Knowledge Engineering
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
Main-memory operation buffering for efficient R-tree update
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A scalable constraint-based Q-hash indexing for moving objects
Information Sciences: an International Journal
Managing Frequent Updates in R-Trees for Update-Intensive Applications
IEEE Transactions on Knowledge and Data Engineering
Workload-aware indexing of continuously moving objects
Proceedings of the VLDB Endowment
Continuous online index tuning in moving object databases
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.07 |
Supporting high update throughput is important to provide real-time location information for many applications, which involve moving objects, such as security, military, and environmental monitoring. We present an R-tree-based index structure with a family of update strategies for supporting high update throughput. It groups updates in the update buffer, and bulk-applies them into the R-tree. Extensive empirical studies have shown that it outperforms existing techniques by 2-5 times. In our experimental environment, moreover, it is able to provide the real-time update capability, while its competitors fail to do so.