Browse > Article

VP Filtering for Efficient Query Processing in R-tree Variants Index Structures  

Kim, Byung-Gon (부천대학 사무자동화과)
Lee, Jae-Ho (인천교육대학 컴퓨터교육과)
Lim, Hae-Chull (홍익대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Databases / v.29, no.6, 2002 , pp. 453-463 More about this Journal
Abstract
With the prevalence of multi-dimensional data such as images, content-based retrieval of data is becoming increasingly important. To handle multi-dimensional data, multi-dimensional index structures such as the R-tree, Rr-tree, TV-tree, and MVP-tree have been proposed. Numerous research results on how to effectively manipulate these structures have been presented during the last decade. Query processing strategies, which is important for reducing the processing time, is one such area of research. In this paper, we propose query processing algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Both for range query and incremental query, for all dimensional index trees, the response time using VP filtering was always shorter than without VP filtering. We quantitatively showed that VP filtering is closely related with the response time of the query.
Keywords
Multidimensional Indexing; VP; R-tree; Filtering;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Stefan Berchtold, Daniel A. Keim, and Hans Peter Kriegel, 'The X-Tree: An Index Structure for High-Dimensional Data,' Proceedings of the VLDB Conference, pages 28-39, 1996
2 Gisli R. Hjaltason and Hanat Samet, 'Ranking in Spatial Databases,' Proceedings of the 4th International Symposium on Large Spatial Databases, Lecture Notes in Computer Science 951, Springer-Verlag, pages 83-95, 1995
3 Antonin Guttman, 'R-Trees: A Dynamic Index Structure for Spatial Searching,' Proceedings of the ACM SIGMOD Conference, pages 47-57, 1984   DOI
4 Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger, 'The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,' Proceedings of the ACM SIGMOD Conference, pages 322-331, 1990   DOI
5 King-Ip Lin, H. V. Jagadish, and Christos Faloutsos, 'The TV-tree - An Index Structure for High-Dimensional Data,' VLDB Journal, Vol. 3(4), pages 517-542, 1994   DOI
6 Peter N. Yianilos, 'Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces,' ACM-SIAM Symposium on Discrete Algorithms, pages 311-321, 1993
7 Tolga Bozkaya and Meral Ozsoyoglu, 'Distance-Based Indexing for High-Dimensional Metric Spaces,' Proceedings of the ACM SIGMOD Conference, pages 357-368, 1997   DOI
8 Jeffrey K. Uhlmann, 'Satisfying General Proximity/ Similarity Queries with Metric Trees,' Information Processing Letters, Vol. 40, pages 175-179, 1991   DOI   ScienceOn
9 Thomas Seidl and Hans-Peter Kriegel, 'Optimal Multi-Step k-Nearest Neighbor Search,' Proceedings of the ACM SIGMOD Conference, pages 154-165, 1998   DOI
10 Nick Roussopoulos, Stephen Kelley, and Frederick Vincent, 'Nearest Neighbor Queries,' Proceedings of the ACM SIGMOD Conference, pages 71-79, 1995   DOI
11 C. Faloutsos, R. Barber, M. Flickener, J. Hafner, et al., 'Efficient and effective Querying by Image content,' Journal of Intelligent Information Systems, Vol3, pages 231-262, 1994   DOI
12 Byung-Gon Kim, Jung-Woon Han, Jaeho Lee, and Hae-Chull Lim, 'Feature Extraction and Query Processing Technique in Image Database Applications : Design and Evaluation,' Proceedings of the ICACT2000, 2000