964 search results - page 61 / 193 » Efficiently Ordering Query Plans for Data Integration |
126
Voted
JDCTA
2010
14 years 11 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
146
click to vote
VLDB
1995
ACM
15 years 8 months ago
1995
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
129
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
163
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those...
132
click to vote
IJCAI
2003
15 years 5 months ago
2003
Speculative execution of information gathering plans can dramatically reduce the effect of source I/O latencies on overall performance. However, the utility of speculation is clos...