Abstract
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.
This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayer, R., Schkolnick, M.: Concurrency of Operations on B-Trees. Acta Inf. 9, 1–21 (1977)
Chen, J.K., Huang, Y.F.: A Study of Concurrent Operations on R-Trees. J. Information Sciences 98, 94–162 (1997)
Eswaren, K., Gray, J., Lorie, R., Traiger, I.: On the Notions of Consistency and Predicate Locks in a Database System. Comm. ACM 19(11), 624–633 (1976)
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57 (1984)
Jagadish, H.V., Lieuwen, D., Rastogi, R., Silberschatz, A., Sudarshan, S.: Dali: A high performance main-memory storage manager. In: Proc. of the Int. Conf. on Very Large Data Bases (1994)
Kornacker, M., Banks, D.: High-Concurrency Locking in R-Trees. In: Proc. of the Int. Conf. on Very Large Data Bases, pp. 134–145 (September 1995)
Kornacker, M., Mohan, C., Hellerstein, J.: Concurrency control and recovery in GiST. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (1997)
Lehman, P., Yao, S.: Efficient Locking for Concurrent Operations on B-Trees. ACM TODS 6(4) (December 1981)
Ng, V., Kamada, T.: Concurrent Accesses to R-Trees. In: Proc. Symp. Large Spatial Databases, pp. 142–161 (1993)
Park, S., Chung, W., Kim, M.: GMS: Spatial database management system. In: Proc. of the KISS Spring Conf. (April 2003)
Rastogi, R., Seshadri, S., Bohannon, P., Leinbaugh, D., Silberschatz, A., Sudarshan, S.: Logical and Physical Versioning in Main Memory Databases. In: Proc. of the Int. Conf. on Very Large Data Bases (August 1997)
Ravi Kanth, K.V., Agrawal, D., Singh, A.K.: Improved concurrency control techniques for multi-dimensional index structures, Technical Report, Univ. of California at santa Barbara (1998)
Prasad Sistla, A., Wolfson, U., Chamberlain, S., Dao, S.: Modeling and querying moving object. In: Proc. of the IEEE Int. Conf. on Data Engineering, pp. 422–432 (April 1997)
Wolfson, O., Xu, B., Chamberlain, S., Jiang, L.: Moving objects databases: Issues and solutions. In: Proc. of the Int. Conf. on Statistical and Scientific Database Management, pp. 111–122 (June 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, M., Eo, S., Jang, S., Lee, J., Bae, H. (2005). Design and Implementation of the Modified R-Tree Structure with Non-blocking Querying. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_11
Download citation
DOI: https://doi.org/10.1007/11563952_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29227-2
Online ISBN: 978-3-540-32087-6
eBook Packages: Computer ScienceComputer Science (R0)