Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data

@article{ART001942495},
author={ Rosslin John Robles },
title={Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data},
journal={예술인문사회 융합 멀티미디어 논문지},
issn={2383-5281},
year={2013},
volume={3},
number={1},
pages={17-24},
doi={10.35873/ajmahs.2013.3.1.003},
url={http://dx.doi.org/10.35873/ajmahs.2013.3.1.003}

TY - JOUR
AU - Rosslin John Robles
TI - Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data
T2 - 예술인문사회 융합 멀티미디어 논문지
PY - 2013
VL - 3
IS - 1
PB - 사단법인 인문사회과학기술융합학회
SP - 17-24
SN - 2383-5281
AB - Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore pre-compute the result of any nearest-neighbor search which corresponds to a computation of the voronoi cell of each data point. In the second step, we store the voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precipitation of the solution space, it is dynamic, i.e. it supports insertions of new data points. An extensive experimental evaluation of our tech-unique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in the X-tree.
KW - Fast nearest-neighbor search, Information retrieval, spatial index, keyword search.
DO - 10.35873/ajmahs.2013.3.1.003
UR - http://dx.doi.org/10.35873/ajmahs.2013.3.1.003
ER -

Rosslin John Robles (2013). Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data. 예술인문사회 융합 멀티미디어 논문지, 3( 1), 17- 24.

Rosslin John Robles . 2013, “Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data”, 예술인문사회 융합 멀티미디어 논문지, vol. 3, no. 1, pp. 17-24. Available from: doi:10.35873/ajmahs.2013.3.1.003

Rosslin John Robles “Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data” 예술인문사회 융합 멀티미디어 논문지 3.1 pp. 17-24 (2013): 17.

Rosslin John Robles . Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data 예술인문사회 융합 멀티미디어 논문지 [Internet]. 2013; 3( 1), : 17-24. Available from: doi:10.35873/ajmahs.2013.3.1.003

Rosslin John Robles . “Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data” 예술인문사회 융합 멀티미디어 논문지 3, no.1 (2013): 17-24. doi: 10.35873/ajmahs.2013.3.1.003

홈 권호 목록 논문 목록 논문 상세

Fast Nearest-Neighbor Search Algorithms Based on High-Multidimensional Data

예술인문사회 융합 멀티미디어 논문지

약어 : AJMAHS

2013, vol.3, no.1, pp.17 - 24

DOI : 10.35873/ajmahs.2013.3.1.003

발행기관 : 사단법인 인문사회과학기술융합학회

연구분야 : 학제간연구

Rosslin John Robles¹

¹University of San Agustin

인용한 논문 수 : 1 서지 간략 보기

초록

Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore pre-compute the result of any nearest-neighbor search which corresponds to a computation of the voronoi cell of each data point. In the second step, we store the voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precipitation of the solution space, it is dynamic, i.e. it supports insertions of new data points. An extensive experimental evaluation of our tech-unique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in the X-tree.

키워드

Fast nearest-neighbor search, Information retrieval, spatial index, keyword search.

참고문헌(20)

[학술대회] S. Agrawal / 2002 / A System for Keyword-based Search over Relational Databases / Proc. Of International Conference on Data Engineering (ICDE) : 5 ~ 16
[학술대회] N. Beckmann / 1990 / The R*-tree: An Efficient and Robust Access Method for Points and Rectangles / Proc. of ACM Management of Data (SIGMOD) : 322 ~ 331
[학술대회] G. Bhalotia / 2002 / Keyword Searching and Browsing in Databases Using Banks / Proc. of International Conference on Data Engineering (ICDE) : 431 ~ 440
[학술지] X. Cao / 2010 / Spatial Keyword Querying. ER, (2012), pp. 16–29. X. Cao, G. Cong, and C. S. Jensen, “Retrieving top-k prestige-based relevant spatial web objects” / PVLDB 3 (1) : 373 ~ 384
[학술대회] X. Cao / 2011 / Collective Spatial Keyword Querying / Proc. of ACM Management of Data (SIGMOD) : 373 ~ 384
[학술대회] B. Chazelle / 2004 / The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables / Proc. of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) : 30 ~ 39
[학술대회] Y.-Y. Chen / 2006 / Efficient Query Processing in Geographic Web Search Engines / Proc. of ACM Management of Data (SIGMOD) : 277 ~ 288
[학술대회] E. Chu / 2009 / Combining Keyword Search and Forms for Ad Hoc Querying of Databases / Proc. of ACM Management of Data (SIGMOD)
[학술지] G. Cong / 2009 / Efficient Retrieval of the top-k most Relevant Spatial Web Objects / PVLDB 2 (1) : 337 ~ 348
[학술지] C. Faloutsos / 1984 / Signature files: An Access Method for Documents and its Analytical Performance Evaluation / ACM Transactions on Information Systems (TOIS) 2 (4) : 267 ~ 288
[학술대회] I. D. Felipe / 2008 / Keyword Search on Spatial Databases / Proc. of International Conference on Data Engineering (ICDE) : 656 ~ 665
[학술대회] R. Hariharan / 2007 / Processing Spatial Keyword (SK) Queries in Geographic Information Retrieval (GIR) Systems / Proc. of Scientific and Statistical Database Management (SSDBM)
[학술지] G. R. Hjaltason / 1999 / Distance Browsing in Spatial Databases / ACM Transactions on Database Systems (TODS) 24 (2) : 265 ~ 318
[학술대회] V. Hristidis / 2002 / Discover: Keyword Search in Relational Databases / Proc. of Very Large Data Bases (VLDB) : 670 ~ 681
[학술대회] I. Kamel / 1994 / Hilbert R-tree: An Improved r-tree Using Fractals / Proc. of Very Large Data Bases (VLDB) : 550 ~ 509
[학술대회] S. Berchtold / 1996 / The X-tree: An Index Structure for High-Dimensional Data / Proc. 22nd Conf. on Very Large Data Bases
[학술대회] T. Brinkhoff / 1993 / Comparison of Approximation of Complex Objects Used for Approximation-based Query Processing in Spatial Database Systems / Proc. 9thInt. Conf. on Data Engineering
[단행본] H. Edelsbrunner / 1987 / Algorithms in Combinatorical Geometry, In EATCS Monographs in Computer Science / Springer
[학위논문] T. Roos / 1991 / Dynamic Voronoi Diagrams
[단행본] F. P. Preparata / 1985 / Computational Geometry: An Introduction / Springer