42 search results - page 5 / 9 » Fast Optimal Twig Joins |
PODS
1999
ACM
13 years 11 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
14 years 5 days 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
2009
ACM
14 years 7 months ago
2009
ACM
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
SIGMOD
1999
ACM
13 years 11 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...