24 search results - page 1 / 5 » Probabilistic Optimization of Top N Queries |
VLDB
1999
ACM
13 years 9 months ago
1999
ACM
The problem of nding the best answers to a query quickly, rather than nding all answers, is of increasing importance as relational databases are applied in multimedia and decision...
WEBDB
2005
Springer
13 years 10 months ago
2005
Springer
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
WAIM
2004
Springer
13 years 10 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
PVLDB
2010
13 years 3 months ago
2010
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...