A model for k-nearest neighbor query processing cost in multidimensional data space

A cost model for the performance of the k-nearest neighbor query in multidimensional data space is presented. Two concepts, the regional average volume and the density function, are introduced to predict the performance for uniform and non-uniform data distributions. The experiment shows that the prediction based on this model is accurate within an acceptable range of the error in low and mid dimensions. (C) 1999 Elsevier Science B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1999-01
Language
ENG
Citation

INFORMATION PROCESSING LETTERS, v.69, no.2, pp.69 - 76

ISSN
0020-0190
URI
http://hdl.handle.net/10203/1930
Appears in Collection
CS-Journal Papers(저널논문)
  • Hit : 330
  • Download : 3
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 7 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0