Abstract
In order for a multi-dimensional index structure to be integrated into a commercial database system, efficient concurrency control techniques are necessary. The techniques must support all degrees of isolation offered by the database system. Especially the degree 3 isolation, called no phantom read, protects search ranges from concurrent insertions and the rollbacks of deletions. In this paper, we propose a new phantom protection method for multi-dimensional index structures that uses multi-level grid technique. The proposed mechanism is independent of the types of multi-dimensional index structures, i.e., it can be applied to all types of index structures such as tree-based, file-based and hash-based index structures. Also, it achieves low development cost and high concurrency with low lock overhead. It is shown through various experiments that the proposed method outperforms existing phantom protection methods for multi-dimensional index structures.
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
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proceedings of ACM SIGMOD, pp. 47–57 (1984)
Silberschatz, A., Galvin, P.B.: Operating System Concepts. Addison-Wesley, Reading (1995)
Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The Grid File: An Adaptable, Symmetric Multikey Structure. ACM Transactions on Database Systems 9(1), 38–71 (1984)
Yoo, J.S., Shin, M.G., Lee, S.H., Choi, K.S., Cho, K.H., Hur, D.Y.: An Efficient Index Structure for High Dimensional Image Data. In: Nishio, S., Kishino, F. (eds.) AMCP 1998. LNCS, vol. 1554, pp. 134–147. Springer, Heidelberg (1999)
Robinson, J.T.: The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes. In: Proceedings of ACM SIGMOD, pp. 10–18 (1981)
Chakrabarti, K., Mehrotra, S.: Dynamic Granular Locking Approach to Phantom Protection in R-Trees. In: Proceedings of ICDE, pp. 446–454 (1998)
Chakrabarti, K., Mehrotra, S.: Efficient Concurrency Control in Multidimensional Access Methods. In: Proceedings of ACM SIGMOD, pp. 25–36 (1999)
Chakrabarti, K., Mehrotra, S.: The Hybrid Tree: An Index Structure for Highdimensional Feature Spaces. In: Proceedings of ICDE, pp. 440–447 (1999)
Eswaren, K., Gray, J., Lorie, R., Traiger, I.: On the Notions of Consistency and Predicate Locks in a Database System. Communication of ACM 19(11), 624–633 (1976)
Whang, K.Y., Kim, S.W., Wiederhold, G.: Dynamic Maintenance of Data Distribution for Selectivity Estimation. Journal of VLDB 3, 29–51 (1994)
Kornacker, M., Mohan, C., Hellerstein, J.M.: Concurrency and Recovery in Generalized Search Trees. In: Proceedings of ACM SIGMOD, pp. 62–72 (1997)
Kornacker, M., Banks, D.: High-Concurrency Locking in R-Trees. In: Proceedings of VLDB, pp. 134–145 (1995)
Indyk, P., Motwani, R.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In: Proceedings of STOC, pp. 604–613 (1998)
Weber, R., Schek, H., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proceedings of VLDB, pp. 194–205 (1998)
Song, S.I., Kim, Y.H., Yoo, J.S.: An Enhanced Concurrency Control Algorithm for Multi-dimensional Index Structures. IEEE Transactions on Knowledge and Data Engineering 16(1), 97–111 (2004)
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
Song, S.I., Lee, S.J., Kang, T.H., Yoo, J.S. (2005). An Efficient Phantom Protection Method for Multi-dimensional Index Structures. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_79
Download citation
DOI: https://doi.org/10.1007/11408079_79
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25334-1
Online ISBN: 978-3-540-32005-0
eBook Packages: Computer ScienceComputer Science (R0)