451 search results - page 7 / 91 » Relationless Completeness and Separations |
CORR
2011
Springer
13 years 1 months ago
2011
Springer
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
SIGMOD
2006
ACM
14 years 6 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
EDBT
2011
ACM
12 years 10 months ago
2011
ACM
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
SIGIR
2009
ACM
14 years 1 months ago
2009
ACM
We consider experiments to measure the quality of a web search algorithm based on how much total time users take to complete assigned search tasks using that algorithm. We first ...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...