624 search results - page 80 / 125 » Mutant Query Plans |
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Errors in estimating page counts can lead to poor choice of access methods and in turn to poor quality plans. Although there is past work in using execution feedback for accurate c...
SOSP
2009
ACM
14 years 6 months ago
2009
ACM
Data-intensive applications are increasingly designed to execute on large computing clusters. Grouped aggregation is a core primitive of many distributed programming models, and i...
AAAI
1990
13 years 11 months ago
1990
Temporal projection-predicting future states of a changing world-has been studied mainly as a formal problem. Researchers have been concerned with getting the concepts of causalit...
VLDB
2004
ACM
14 years 10 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
ICDE
2010
IEEE
14 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...