A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Subspace similarity search using the ideas of ranking and top-k retrieval
2010
2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)
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
doi:10.1109/icdew.2010.5452771
dblp:conf/icde/BerneckerEGKKRSZ10
fatcat:6th4regexrgctc23gaa5gzwobe