The Method to Process Nearest Neighbor Queries Using an Optimal Search Distance


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 9, pp. 2173-2184, Sep. 1997
10.3745/KIPSTE.1997.4.9.2173,   PDF Download:

Abstract

Among spatial queries handled in spatial database systems, nearest neighbor queries to find the nearest spatial object from the given location occur frequently. The number of searched nodes in an index must be minimized in order to increase the performance of nearest neighbor queries. An Existing approach considered only the processing of an nearest neighbor query in a two-dimensional search space and could not optimize the number of searched nodes accurately. In this paper, we propose the optimal search distance and prove its properties. The proposed optima search distance is the measurement of a new search distance for accurately selecting the nodes which will be searched in processing nearest neighbor queries. We present an algorithm for processing the nearest neighbor query by applying the optimal search distance to R-trees and prove that the result of query processing is corrector than the existing approach.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Joon, H. B. Hyun, R. K. Ho, "The Method to Process Nearest Neighbor Queries Using an Optimal Search Distance," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 9, pp. 2173-2184, 1997. DOI: 10.3745/KIPSTE.1997.4.9.2173.

[ACM Style]
Seon Hwi Joon, Hwang Bu Hyun, and Ryu Keun Ho. 1997. The Method to Process Nearest Neighbor Queries Using an Optimal Search Distance. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 9, (1997), 2173-2184. DOI: 10.3745/KIPSTE.1997.4.9.2173.