483 search results - page 33 / 97 » Evaluating Top-k Selection Queries |
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
EEE
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper focuses on question selection methods for conversational recommender systems. We consider a scenario, where given an initial user query, the recommender system may ask ...
ADBIS
2006
Springer
14 years 1 months ago
2006
Springer
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
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...
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...