|
|
|
     |
                                     |
Return to Similarity Queries II
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especially for CAD applications, suitable similarity models can help to reduce the cost of developing and producing new parts by maximizing the reuse of existing parts. Most of the existing similarity models are based on feature vectors. In this paper, we shortly review three models which pursue this paradigm. Based on the most promising of these three models, we explain how sets of feature vectors can be used for more effective and still efficient similarity search. We first introduce an intuitive distance measure on sets of feature vectors together with an algorithm for its efficient computation. Furthermore, we present a method for accelerating the processing of similarity queries on vector set data. The experimental evaluation is based on two real world test data sets and points out that our new similarity approach yields more meaningful results in comparatively short time.
@inproceedings {DBLP:conf/sigmod/KriegelBKPS03, author = {Hans-Peter Kriegel and Stefan Brecheisen and Peer Kröger and Martin Pfeifle and Matthias Schubert}, booktitle = {SIGMOD Conference}, title = {Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects.}, pages = {587-598}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#KriegelBKPS03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r22p01.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
