Sciweavers

Share
SSDBM
2010
IEEE

Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces

9 years 4 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three existing approaches are variations of the sequential scan. Here, we propose the first index-based solution to subspace similarity search in arbitrary subspaces.
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2010
Where SSDBM
Authors Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Erich Schubert, Arthur Zimek
Comments (0)
books