Efficient Incremental Query Processing via Vantage Point Filtering in Dynamic Multi-Dimensional Index Structures(Special Section on Papers Selected from ITC-CSCC 2000)

概要

論文の詳細を見る
Efficient query processing in multi-dimensional indexing structures is an important issue for multimedia data applications. In this paper, we propose incremental κ-nearest neighbor query(κ-NNQ) and range query 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. Results show that improvements range from 8% to 23% in response time for the experimental environment that we considered.
社団法人電子情報通信学会の論文
2001-06-01