Efficient Incremental Query Processing via Vantage Point Filtering in Dynamic Multi-Dimensional Index Structures
Summary :
Efficient query processing in multi-dimensional indexing structures is an important issue for multimedia data applications. In this paper, we propose incremental k-nearest neighbor query (k-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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.6 pp.1413-1422
- Publication Date
- 2001/06/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Papers Selected from 2000 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2000))
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Byung-Gon KIM, Sam Hyuk NOH, DoSoon PARK, Haechull LIM, Jaeho LEE, "Efficient Incremental Query Processing via Vantage Point Filtering in Dynamic Multi-Dimensional Index Structures" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 6, pp. 1413-1422, June 2001, doi: .
Abstract: Efficient query processing in multi-dimensional indexing structures is an important issue for multimedia data applications. In this paper, we propose incremental k-nearest neighbor query (k-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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_6_1413/_p
Copy
@ARTICLE{e84-a_6_1413,
author={Byung-Gon KIM, Sam Hyuk NOH, DoSoon PARK, Haechull LIM, Jaeho LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Incremental Query Processing via Vantage Point Filtering in Dynamic Multi-Dimensional Index Structures},
year={2001},
volume={E84-A},
number={6},
pages={1413-1422},
abstract={Efficient query processing in multi-dimensional indexing structures is an important issue for multimedia data applications. In this paper, we propose incremental k-nearest neighbor query (k-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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Efficient Incremental Query Processing via Vantage Point Filtering in Dynamic Multi-Dimensional Index Structures
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1413
EP - 1422
AU - Byung-Gon KIM
AU - Sam Hyuk NOH
AU - DoSoon PARK
AU - Haechull LIM
AU - Jaeho LEE
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2001
AB - Efficient query processing in multi-dimensional indexing structures is an important issue for multimedia data applications. In this paper, we propose incremental k-nearest neighbor query (k-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.
ER -
English
