Browse > Article

PPMMLG : A Phantom Protection Method based on Multi-Level Grid Technique for Multi-dimensional Index Structures  

Lee, Seok-Jae (충북대학교 정보통신공학과)
Song, Seok-Il (충주대학교 전기전자정보공학부)
Yoo, Jae-Soo (충북대학교 전기전자컴퓨터공학부)
Publication Information
Journal of KIISE:Databases / v.32, no.3, 2005 , pp. 304-314 More about this Journal
Abstract
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.
Keywords
Concurrency control; Phantom protection; Multi-dimensional index structure;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Mohan, 'ARIES/KVL: A Key Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes,' Proceedings of VLDB, 1990, PP. 392-405
2 K. V. Ravi, Kanth, D. Serena and A. K. Singh, 'Improved Concurrency Control Techniques for Multi-Dimensional Index Structures,' Proceedings of Symposium on Parallel and Distributed Processing, 1998, pp. 580-586
3 M. Kornacker, C. Mohan and J. M. Hellerstein, 'Concurrency and Recovery in Generalized Search Trees,' Proceedings of ACM SIGMOD, 1997, pp. 62-72   DOI
4 K. Chakrabarti and S. Mehrotra, 'Efficient Concurrency Control in Multidimensional Access Methods,' Proceedings of ACM SIGMOD, 1999, pp. 25-36   DOI
5 J. K. Chen and Y. F. Huang, 'A Study of Concurrent Operations on R-Trees,' Journal of Information Sciences, Vol. 98, No. 1-4, 1997, pp 263-300   DOI   ScienceOn
6 R. Weber, H. Schek and S. Blott, 'A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces,' Proceedings of VLDB, 1998, pp 194-205
7 K. Chakrabarti and S. Mehrotra, 'The Hybrid Tree : An Index Structure for High-dimensional Feature Spaces,' Proceedings of ICDE, 1999, pp.440-447   DOI
8 P. Indyk and R. Motwani 'Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality,' Proceedings of STOC, 1998, pp. 604-613   DOI
9 K. Chakrabarti and S. Mehrotra, 'Dynamic Granular Locking Approach to Phantom Protection in R-Trees,' Proceedings of ICDE, 1998, pp. 446-454   DOI
10 J. S. Yoo, M. G. Shin, S. H. Lee, K. S. Choi, K. H. Cho and D. Y. Hur, 'An Efficient Index Structure for High Dimensional Image Data,' Proceedings of AMCP, 1998, pp. 134-147
11 N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger, 'The R$Wast$-tree : An Efficient and Robust Access Method for Points and Rectangles,' Proceedings of ACM SIGMOD, 1990, pp.322-331   DOI
12 S. Berchtold, D. A. Keim, and H. P. Kriegel, 'The X-Tree: An Index Structure for High-dimensional Data,' Proceedings of VLDB, 1996, pp. 28-39
13 J. T. Robinson, 'The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes,' Proceedings of ACM SIGMOD, 1981, pp. 10-18   DOI
14 N. Katayama and S. Satoh, 'The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries,' Proceedings of ACM SIGMOD, 1997, pp. 369-380
15 P. Ciaccia, M. Patella, and P. Zezula, 'M-tree: An Efficient Access Method for Similarity Search in Metric Spaces,' Proceedings of VLDB, 1997, pp. 426-435
16 K. I. Lin, H. Jagadish and C. Faloutsos, 'The TV-tree: An Index Structure for High-Dimensional Data,' Journal of VLDB, Vol.3, No. 4, 1994, pp.517-542   DOI
17 R. A. Finkel and J. L. Bentley, 'Quad Trees: A Data Structure for Retrieval on Composite Keys,' Acta Informatica, Vol. 4, 1974, pp. 1-9   DOI
18 A. Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' Proceedings of ACM SIGMOD, 1984, pp.47-57   DOI
19 J. Nievergelt, H. Hinterberger, and K. C. Sevcik, 'The Grid File : An Adaptable, Symmetric Multikey Structure,' ACM Transactions on Database Systems, Vol. 9, No. 1, 1984, pp. 38-71   DOI   ScienceOn
20 T. Sellis, N. Roussopoulos and C. Faloutsos, 'The R+-Tree: A Dynamic Index for Multi-Dimensional Objects,' Proceedings of VLDB, 1987, pp. 507-518
21 S. I. Song, Y. H. Kim and J. S. Yoo, 'An Enhanced Concurrency Control Algorithm for Multi-dimensional Index Structures,' IEEE Transactions on Knowledge and Data Engineering, Vol. 16, No. 1, 2004, pp. 97-111   DOI   ScienceOn
22 M. Chae, K. Hong, M. Lee, J. Kim, O. Joe, S. Jeon and Y. Kim, 'Design of the Object Kernel of BADA-III: An Object-Oriented Database Management System for Multimedia Data Service,' Proceedings of Workshop on Network and System Management, 1995
23 C. Mohan and F. Levine, 'ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging,' Proceedings of ACM SIGMOD, 1992, pp. 371-380   DOI
24 K. Y. Whant, S. W. Kim, G. Wiederhold, 'Dynamic Maintenance of Data Distribution for Selectivity Estimation,' Journal of VLDB, Vol. 3, 1994, pp, 29-51   DOI
25 M. Kornacker and D. Banks, 'High-Concurrency Locking in R-Trees,' Proceedings of VLDB, 1995, pp. 134-145