论文信息 - A Cost Model for Incremental Nearest Neighbor Search in Multidimensional Spaces

A Cost Model for Incremental Nearest Neighbor Search in Multidimensional Spaces

Nearest Neighbor (NN) search has been widely used in spatial databases and multimedia databases. Incremental NN (INN) search is regarded as the optimal NN search because of the minimum number of node accesses and it can be used no matter whether the number of objects to be retrieved is fixed or not in advance. R*-tree is still regarded as being among the best high- dimensional indices. This paper presents an analytical model for estimating performance of the INN search algorithm on R*-tree. The theoretical analysis is verified by experiments.

Yaokai Feng | Kunihiko Kaneko | Akifumi Makinouchi

[1] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[2] Christos Faloutsos,et al. On packing R-trees , 1993, CIKM '93.

[3] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.

[4] Christian Böhm,et al. A cost model for nearest neighbor search in high-dimensional data space , 1997, PODS.

[5] Changzhou Wang,et al. Indexing very high-dimensional sparse and quasi-sparse vectors for similarity searches , 2001, The VLDB Journal.

[6] Yannis Manolopoulos,et al. Performance of Nearest Neighbor Queries in R-Trees , 1997, ICDT.

[7] Christos Faloutsos,et al. Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension , 1994, PODS.

[8] Martin L. Kersten,et al. Database Architecture Optimized for the New Bottleneck: Memory Access , 1999, VLDB.

[9] Kihong Kim,et al. Optimizing multidimensional index trees for main memory access , 2001, SIGMOD '01.