Abstract
This paper proposes the improved concurrency control technique with lock-free querying for multi-dimensional index structure. In highly concurrent workloads due to frequent updates for storing location of moving object, the variants of R-tree structure cannot provide the real-time response. Because query processing is frequently blocked by node-split or region propagation as the locations of objects change. This paper improves the query performance by using the new versioning technique. It does not physically modify data, but creates new version for compensating 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 the proposed 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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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 (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) (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 (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 (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 (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 (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, MK., Bae, HY. (2005). Improved Concurrency Control Technique with Lock-Free Querying for Multi-dimensional Index Structure. In: Lee, G.G., Yamada, A., Meng, H., Myaeng, S.H. (eds) Information Retrieval Technology. AIRS 2005. Lecture Notes in Computer Science, vol 3689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562382_4
Download citation
DOI: https://doi.org/10.1007/11562382_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29186-2
Online ISBN: 978-3-540-32001-2
eBook Packages: Computer ScienceComputer Science (R0)