619 search results - page 59 / 124 » Query Planning in Infomaster |
141
click to vote
VLDB
1995
ACM
15 years 7 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...
138
click to vote
UAI
2000
15 years 5 months ago
2000
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...
200
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Suppose a long-running analytical query is executing on a database server and has been allocated a large amount of physical memory. A high-priority task comes in and we need to ru...
102
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
112
click to vote
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
— Our goal is to create roadmaps that are particularly suited for motion planning in virtual environments. We use our Reachability Roadmap Method to compute an initial, resolutio...