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


Vol. 6,  No. 1, pp. 32-41, Jan.  1999
10.3745/KIPSTE.1999.6.1.32


PDF
  Abstract

In spatial database systems, the nearest neighbor query occurs frequently and requires the processing cost higher than other spatial queries do. The number of nodes to be searched in the index can be minimized for optimizing the cost of processing the nearest neighbor query. The optimal search distance is proposed for the measurement of a search distance to accurately select the nodes which will be searched in the nearest neighbor query. In this paper, we prove properties of the optimal search distance in N-dimensional. We show through experiments that the performance of query processing of our method is superior the other method using maximum search distance.

  Statistics
  Cite this article

[IEEE Style]

S. H. Joon and K. H. Ki, "The Performance Evaluation of Method to Process Nearest Neighbor Queries Using an Optimal Search Distance," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 1, pp. 32-41, 1999. DOI: 10.3745/KIPSTE.1999.6.1.32.

[ACM Style]

Seon Hwi Joon and Kim Hong Ki. 1999. The Performance Evaluation of Method to Process Nearest Neighbor Queries Using an Optimal Search Distance. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 1, (1999), 32-41. DOI: 10.3745/KIPSTE.1999.6.1.32.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals