A study of concurrent operations on R-trees
Information Sciences: an International Journal
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient locking for concurrent operations on B-trees
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Logical and Physical Versioning in Main Memory Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Dalí: A High Performance Main Memory Storage Manager
VLDB '94 Proceedings of the 20th 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
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
Hi-index | 0.00 |
In highly concurrent field such as location based services, massive objects are moving concurrently. Due to continuously changing nature of their location, traditional indexes cannot provide the real-time response since query processing is frequently blocked by node-split or region propagation as the locations of objects change. In this paper, the modified R-tree structure with lock-free querying for multi-dimension data, Rver-tree, is proposed. Basically, Rver-tree uses the new versioning technique. When updating data such as key update(region propagation) and index restructure(node-split), it never physically modify original data, rather creates new version for compensating data intactness. Due to data intactness, search operation can access data without any locking or latching by reading old version. In the performance evaluation, it is proven that search operation of Rver-tree is at least two times faster than a previous work.