An Enhanced Concurrency Control Scheme for Multidimensional Index Structures

IEEE Transactions on Knowledge and Data Engineering

Volumn 16, Issue 1, 2004, Pages 97-111

  Song II, Seok ^a   Kim, Young Ho ^b   Yoo, Jae Soo ^a  

^a Chungbuk National University   (South Korea)

^b Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

Author keywords

Concurrency control; Multidimensional index structure; Performance evaluation

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; CONTENT BASED RETRIEVAL; DATABASE SYSTEMS; DIGITAL LIBRARIES; GEOGRAPHIC INFORMATION SYSTEMS; INFORMATION RETRIEVAL SYSTEMS; OPTIMIZATION; PERFORMANCE; PROBLEM SOLVING;

MINIMUM BOUNDARY REGIONS (MBR); MULTIDIMENSIONAL INDEX STRUCTURE; PERFORMANCE EVALUATION;

DATA STRUCTURES;

EID: 0742268577     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2004.1264825     Document Type: Article

References (20)

1. A. Guttman, "R-Trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD, pp. 47-57, 1984.
2. C. Mohan, D. Harderle, B. Lindsay, H. Pirahesh, and P. Schwarz, "ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write Ahead Logging," Trans. Database Systems, vol. 17, no. 1, pp. 94-162, 1992.
3. C. Mohan and F. Levine, "ARIES/IM: An Efficient and High Concurrency Index Management Method Using Write-Ahead Logging," Proc. ACM SIGMOD, pp. 371-380, 1992.
4. D.A. White and R. Jain, "Similarity Indexing with the SS-Tree, " Proc. Int'l Conf. Data Eng., pp. 516-523, 1996.
5. J.K. Chen and Y.F. Huang, "A Study of Concurrent Operations on R-Trees," J. Information Sciences, vol. 98, nos. 1-4, pp 263-300, 1997.
6. 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," Proc. Intl. Conf. Advanced Multimedia Content Processing, pp. 134-147, 1998.
7. K. Chakrabarti and S. Mehrotra, "The Hybrid Tree: An Index Structure for High-Dimensional Feature Spaces," Proc. Int'l Conf. Data Eng., pp. 440-447, 1999.
8. K.I. Lin, H. Jagadish, and C. Faloutsos, "The TV-Tree: An Index Structure for High Dimensional Data," The VLDB J., vol. 3, no. 4, pp. 517-542, 1994.
9. 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," Proc. Workshop Network and System Management, 1995.
10. M. Kornacker, C. Mohan, and J.M. Hellerstein, "Concurrency, and Recovery in Generalized Search Trees," Proc. ACM SIGMOD, pp. 62-72, 1997.
11. M. Kornacker and D. Banks, "High-Concurrency Locking in R-Trees," Proc. Very Large Data Bases Conf., pp. 134-145, 1995.
12. N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, "The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles," Proc. ACM SIGMOD, pp. 322-331, 1990.
13. N. Katayama and S. Satoh, "The SR-Tree: An Index Structure for High-Dimensional Nearest Neighbor Queries," Proc. ACM SIGMOD, pp. 369-380, 1997.
14. P.L. Lehmann and S.B. Yao, "Efficient Locking for Concurrent Operations on B-Trees," ACM Trans. Database Systems, vol. 6, no. 4, pp. 650-670, 1981.
15. K.V. Ravi Kanth, D. Serena, and A.K. Singh, "Improved Concurrency Control Techniques for Multi-Dimensional Index Structures," Proc. Symp. Parallel and Distributed Processing, pp. 580-586, 1998.
16. S. Berchtold, D.A. Keim, and H.P. Kriegel, "The X-Tree: An Index Structure for High-Dimensional Data," Proc. Very Large Data Bases Conf., pp. 28-39, 1996.
17. V. Ng and T. Kamada, "Concurrent Accesses to R-Trees," Proc. Symp. Large Spatial Databases, pp. 142-161, 1993.
18. A. Silberschatz and P.B. Galvin, Operating System Concepts. Addison-Wesley, 1995.
19. K. Chakrabarti and S. Mehrotra, "Dynamic Granular Locking Approach to Phantom Protection in R-Trees," Proc. Int'l Conf. Data Eng., pp. 446-454, 1998.
20. K. Chakrabarti and S. Mehrotra, "Efficient Concurrency Control in Multidimensional Access Methods," Proc. SIGMOD, pp. 25-36, 1999.