624 search results - page 23 / 125 » Mutant Query Plans |
110
click to vote
EDBT
2012
ACM
13 years 2 months ago
2012
ACM
We present an effective optimization framework for general SQLlike map-reduce queries, which is based on a novel query algebra and uses a small number of higher-order physical ope...
SIGMOD
2003
ACM
15 years 12 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
196
click to vote
SIGMOD
2009
ACM
16 years 23 hour ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
FUIN
2006
14 years 11 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
104
click to vote
PPAM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...