ACM Home Page
Please provide us with feedback. Feedback
Online aggregation
Full text PdfPdf (1.92 MB)
Source International Conference on Management of Data archive
Proceedings of the 1997 ACM SIGMOD international conference on Management of data table of contents
Tucson, Arizona, United States
Pages: 171 - 182  
Year of Publication: 1997
ISBN:0-89791-911-4
Also published in ...
Authors
Joseph M. Hellerstein  Computer Science Division, University of California, Berkeley
Peter J. Haas  Almaden Research Center, IBM Research Division
Helen J. Wang  Computer Science Division, University of California, Berkeley
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 182,   Citation Count: 162
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/253260.253291
What is a DOI?

ABSTRACT

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, eventually, the final answer is returned. This archaic approach is frustrating to users and has been abandoned in most other areas of computing. In this paper we propose a new online aggregation interface that permits users to both observe the progress of their aggregation queries and control execution on the fly. After outlining usability and performance requirements for a system supporting online aggregation, we present a suite of techniques that extend a database system to meet these requirements. These include methods for returning the output in random order, for providing control over the relative rate at which different aggregates are computed, and for computing running confidence intervals. Finally, we report on an initial implementation of online aggregation in POSTGRES.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AAD+96
 
ACSW96
 
AZ96
 
Bil86
P. Billingsley. Probability and Measure. Wiley, New York, second edition, 1986.
BM96
 
Bra84
 
CCS93
E. F. Codd, S. B. Codd, and C. T. Sal- Icy. Providing OLAP (on-line analyticalprocessing) to user-analysts: an IT mandate.URL http://www.arborsoft.com/papers/coddTOC.htmI., I993.
 
CGL83
T. F. Chan, G. H. Golub, and R. J. LeVeque. Algorithms for computing the sample variance: Analysis and recommendation. Amer. Statist., 37:242-247, 1983.
 
CS96
DKO+84
 
GBLP96
 
GHQ95
 
Haa96a
P. J. Haas. Hoeffding inequalities for join-selectivity estimation and online aggregation. IBM Research Report RJ 10040, IBM Almaden Research Center, San Jose, CA, 1996.
 
Haa96b
P. J. Haas. Large-sample and deterministic confidence intervals for online aggregation. IBM Research Report RJ 10050, IBM Almaden Research Center, San Jose, CA, 1996.
HN96
 
HNSS96
HOD91
 
Hoe63
W. Hoeffding. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58:13- 30, 1963.
HOT88
HOT89
 
LNSS93
Mye85
 
Olk93
F. Olken. Random Sampling from Databases. PhD thesis, University of California, Berkeley, 1993.
 
Pos95
Postgres95 home page,1995. UFI.L http://www, ki.net / postgres95.
SAC+79
SHP+96
 
SPL96
 
VU92
 
VL93
 
WA91
 
YL95

CITED BY  162

Collaborative Colleagues:
Joseph M. Hellerstein: colleagues
Peter J. Haas: colleagues
Helen J. Wang: colleagues