Search Efficiency in Indexing Structures for Similarity Searching

Details Search Efficiency in Indexing Structures for Similarity Searching Search Efficiency in Indexing Structures for Similarity Searching

2004-03-11

arxiv.org/abs/cs/0403014v2

Computer Science

Databases

Scientific paper

Similarity searching finds application in a wide variety of domains including multilingual databases, computational biology, pattern recognition and text retrieval. Similarity is measured in terms of a distance function, edit distance, in general metric spaces, which is expensive to compute. Indexing techniques can be used reduce the number of distance computations. We present an analysis of various existing similarity indexing structures for the same. The performance obtained using the index structures studied was found to be unsatisfactory . We propose an indexing technique that combines the features of clustering with M tree(MTB) and the results indicate that this gives better performance.

Affiliated with

Also associated with

No associations

Rating

Search Efficiency in Indexing Structures for Similarity Searching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Search Efficiency in Indexing Structures for Similarity Searching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search Efficiency in Indexing Structures for Similarity Searching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452205