619 search results - page 29 / 124 » Query Planning in Infomaster |
91
Voted
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
128
click to vote
EDBT
2012
ACM
13 years 4 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...
122
click to vote
SIGMOD
2003
ACM
16 years 2 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...
214
click to vote
SIGMOD
2009
ACM
16 years 2 months 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...
136
click to vote
EDBT
2011
ACM
14 years 5 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...