18 search results - page 2 / 4 » Robust Heuristics for Scalable Optimization of Complex SQL Q... |
PVLDB
2008
13 years 6 months ago
2008
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
MDM
2009
Springer
14 years 1 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
VLDB
2002
ACM
13 years 7 months ago
2002
ACM
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...