88 search results - page 5 / 18 » On Using Extended Statistical Queries to Avoid Membership Qu... |
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Counting Bloom Filters (CBFs) are widely used in networking device algorithms. They implement fast set representations to support membership queries with limited error, and supp...
WIDM
2003
ACM
14 years 27 days ago
2003
ACM
Query rewriting using views is an essential issue in data integration. A number of algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the M...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
SIGIR
2005
ACM
14 years 1 months ago
2005
ACM
We describe a method for predicting query difficulty in a precision-oriented web search task. Our approach uses visual features from retrieved surrogate document representations (...