24 search results - page 2 / 5 » Incorporating partitioning and parallel plans into the SCOPE... |
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
PVLDB
2010
13 years 53 min ago
2010
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
VLDB
2005
ACM
13 years 10 months ago
2005
ACM
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
PVLDB
2008
13 years 4 months ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...