37 search results - page 1 / 8 » Surrogate Ranking for Very Expensive Similarity Queries |
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
SIGMOD
2002
ACM
14 years 5 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
PVLDB
2008
13 years 4 months ago
2008
We study selectivity estimation techniques for set similarity queries. A wide variety of similarity measures for sets have been proposed in the past. In this work we concentrate o...