624 search results - page 25 / 125 » Mutant Query Plans |
VLDB
1994
ACM
15 years 3 months ago
1994
ACM
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
112
click to vote
AAAI
2010
15 years 1 months ago
2010
We present novel randomized algorithms for solving global motion planning problems that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data...
EDBT
2004
ACM
15 years 12 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
VLDB
1995
ACM
15 years 3 months ago
1995
ACM
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
193
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...