Indexing and Similarity Search
Data organization; Hierarchical data organization; Space partitioning; Space segmentation
Indexing refers to the process of efficient data organization. It is closely related to similarity search because it allows such costly operations over a large dataset of objects to be efficiently sped up. Indices (or indexes) are hierarchical structures that direct the search to the most promising part of the database, hence eliminating from examination a large portion of objects. One can make the analogy with phone books, where all entries are recorded in sorted alphabetical order; therefore search involves only the lookup at the relevant portion of the book.
Traditional indexing structures include the B-trees. However, B-trees organize the data based on a single attribute/feature. Many of todays multimedia data contain hundreds or thousands of features. As an example, a small B&W image of 50 × 50 pixels contains 2500 points/features. In order to...
- 2.Beckmann N, Kriegel H.-P, Schneider R, Seeger B. The r*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1990. p. 322–31.Google Scholar
- 6.Ciaccia P, Patella M, Zezula P. M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1997. p. 426–35.Google Scholar
- 7.Guttman A. R-trees: a dynamic index structure for spatial searching. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1984. p. 47–57.Google Scholar
- 8.Keogh E, Chakrabarti K, Pazzani M, Mehrotra S. Locally adaptive dimensionality reduction for indexing large time series databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001. p. 151–62.Google Scholar
- 10.Roussopoulos N, Kelley S, Vincent F. Nearest neighbor queries. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1995. p. 71–9.Google Scholar
- 12.Yianilos P. Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the 4th Annual ACM -SIAM Symposium on Discrete Algorithms; 1993. p. 311–21.Google Scholar