Grid file with approximation for multi-dimensional nearest neighbor search

Zhiyuan Dong, Chin Fang Wang, Meng Su, Wen Chi Hou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose an approach to improve the grid file approach to the nearest neighbor (NN) search in multidimensional data spaces. The original approach is very efficient for low to medium dimensional database applications. However, its performance degrades when dimensionality becomes higher. In order to adapt the approach to higher dimensional databases, we build an approximation file based on the grid file. Then we first search the NN in the approximation file to filter out possible candidates before we actually go to the relative partition to pin down the true NN. By this way, the grid file approach is well adapted to higher dimensional databases. Our simulations show that the improved grid file approach outperforms other approaches in higher dimensional databases.

Original languageEnglish (US)
Title of host publicationWMSCI 2005 - The 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Proceedings
Pages222-227
Number of pages6
Volume1
Publication statusPublished - 2005
Event9th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2005 - Orlando, FL, United States
Duration: Jul 10 2005Jul 13 2005

Other

Other9th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2005
CountryUnited States
CityOrlando, FL
Period7/10/057/13/05

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Computer Networks and Communications
  • Information Systems

Cite this

Dong, Z., Wang, C. F., Su, M., & Hou, W. C. (2005). Grid file with approximation for multi-dimensional nearest neighbor search. In WMSCI 2005 - The 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Proceedings (Vol. 1, pp. 222-227)