We present a new family of join algorithms, called ripple joins, for online processing of multi-
table aggregation queries in a relational database management system (DBMS). Such …

Recently, Haas and Hellerstein proposed the hash ripple join algorithm in the context of
online aggregation. Although the algorithm rapidly gives a good estimate for many join …

Joins are expensive, and online aggregation over joins was proposed to mitigate the cost,
which offers users a nice and flexible tradeoff between query efficiency and accuracy in a …

The online aggregation system recently proposed by JM Hellerstein, et al.(1997) permits
interactive exploration of large, complex datasets stored in relational database management …

Aggregation in traditional database systems is performed in batch mode: a query is
submitted, the system processes a large volume of data over a long period of time, and …

In this paper, we propose an online aggregation system called COSMOS (Continuous
Sampling for Multiple queries in an Online aggregation System), to process multiple …

In many decision making applications, users typically issue aggregate queries. To evaluate
these computationally expensive queries, online aggregation has been developed to …

The ability to approximately answer aggregation queries accurately and efficiently is of great
benefit for decision support and data mining tools. In contrast to previous sampling-based …

Aggregation and duplicate removal are common in SQL queries. However, in the parallel
query processing literature, aggregate processing has received surprisingly little attention; …

Active data warehousing has emerged as an alternative to conventional warehousing
practices in order to meet the high demand of applications for up-to-date information. In a …