Gesellschaft für Informatik e.V.

Lecture Notes in Informatics


Datenbanksysteme in Business, Technologie und Web, 11. Fachtagung des GIFachbereichs “Datenbanken und Informationssysteme” (DBIS), 2.-4. März 2005 Karlsruhe. GI 2005 P-65, 425-443 (2005).

GI, Gesellschaft für Informatik, Bonn
2005


Editors

Gottfried Vossen, Frank Leymann, Peter Lockemann, Wolffried Stucky (eds.)


Copyright © GI, Gesellschaft für Informatik, Bonn

Contents

Efficient similarity search on vector sets

Stefan Brecheisen , Hans-Peter Kriegel and Martin Pfeifle

Abstract


Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aided design and many others. Whereas most of the existing similarity models are based on feature vectors, there exist some models which use very complex object representations such as trees and graphs. A promising way between too simple and too complex object representations in similarity search are sets of feature vectors. In this paper, we first motivate the use of this modeling approach for complete object similarity search as well as for partial object similarity search. After


Full Text: PDF

GI, Gesellschaft für Informatik, Bonn
ISBN 3-885794-6


Last changed 24.01.2012 21:50:15