6274 search results - page 160 / 1255 » From query complexity to computational complexity |
182
click to vote
SIGMOD
2004
ACM
16 years 4 months ago
2004
ACM
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
137
click to vote
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
The power of search is with no doubt one of the main aspects for the success of the Web. Currently available search engines on the Web allow to return results with a high precisio...
221
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
123
click to vote
GIS
1999
ACM
15 years 8 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
144
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....