The VLDB Journal

, Volume 3, Issue 4, pp 517–542

The TV-tree: An index structure for high-dimensional data

  • King-Ip Lin
  • H. V. Jagadish
  • Christos Faloutsos
Article

DOI: 10.1007/BF01231606

Cite this article as:
Lin, KI., Jagadish, H.V. & Faloutsos, C. VLDB Journal (1994) 3: 517. doi:10.1007/BF01231606

Abstract

We propose a file structure to index high-dimensionality data, which are typically points in some feature space. The idea is to use only a few of the features, using additional features only when the additional discriminatory power is absolutely necessary. We present in detail the design of our tree structure and the associated algorithms that handle such “varying length” feature vectors. Finally, we report simulation results, comparing the proposed structure with theR*-tree, which is one of the most successful methods for low-dimensionality spaces.The results illustrate the superiority of our method, which saves up to 80% in disk accesses.

Key Words

Spatial indexsimilarity retrievalquery by content

Copyright information

© VLDV 1994

Authors and Affiliations

  • King-Ip Lin
    • 1
  • H. V. Jagadish
    • 2
  • Christos Faloutsos
    • 1
  1. 1.Department of Computer ScienceUniversity of MarylandCollege Park
  2. 2.AT&T Bell LaboratoriesMurray Hill