iDistance: An adaptive B+-tree based indexing method for nearest neighbor search

  • Authors:

  • H. V. Jagadish;Beng Chin Ooi;Kian-Lee Tan;Cui Yu;Rui Zhang

  • Affiliations:

  • University of Michigan, Ann Arbor, MI;National University of Singapore, Singapore;National University of Singapore, Singapore;Monmouth University, West Long Branch, NJ;National University of Singapore, Singapore

  • Venue:
  • ACM Transactions on Database Systems (TODS)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article, we present an efficient B+-tree based indexing method, called iDistance, for K-nearest neighbor (KNN) search in a high-dimensional metric space. iDistance partitions the data based on a space- or data-partitioning strategy, and selects a reference point for each partition. The data points in each partition are transformed into a single dimensional value based on their similarity with respect to the reference point. This allows the points to be indexed using a B+-tree structure and KNN search to be performed using one-dimensional range search. The choice of partition and reference points adapts the index structure to the data distribution.We conducted extensive experiments to evaluate the iDistance technique, and report results demonstrating its effectiveness. We also present a cost model for iDistance KNN search, which can be exploited in query optimization.