20 search results - page 2 / 4 » An Empirical Comparison of Randomized Algorithms for Large J... |
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...
PODS
1999
ACM
13 years 9 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...