6004 search results - page 203 / 1201 » Parallelizing query optimization |
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...
WAIM
2004
Springer
14 years 3 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 ...
SEBD
2007
13 years 11 months ago
2007
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...
SIGMOD
2002
ACM
13 years 10 months ago
2002
ACM
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...