Improvements in Distance-Based Indexing

Authors:
Murat Tasan;Z. Meral Ozsoyoglu
Affiliations:
Case Western Reserve University, Cleveland, OH;Case Western Reserve University, Cleveland, OH
Venue:
SSDBM '04 Proceedings of the 16th International Conference on Scientific and Statistical Database Management
Year:
2004

Citing 0
Cited 4

Efficient processing of complex similarity queries in RDBMS through query rewriting

CIKM '06 Proceedings of the 15th ACM international conference on Information and knowledge management
A hyperplane based indexing technique for high-dimensional data

Information Sciences: an International Journal
Metric space similarity joins

ACM Transactions on Database Systems (TODS)
A novel optimization approach to efficiently process aggregate similarity queries in metric access methods

Proceedings of the 17th ACM conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work offers some improvements in the currentdistance-based indexing techniques. An optimal similaritysearch algorithm that is adopted from vector-based indexingis shown to be also optimal for distance-based indices.Further similarity between the two types of indexingis revealed, leading to a general description of searchstructures. A probabilistic analysis of distance-based treeindices is also shown to be possible, allowing direct comparisonsof structures without the need for extensive experimentation.This analysis will lend itself to future improvedindex construction algorithms.