Online aggregation
Joseph M. Hellerstein, Peter J. Haas, Helen J. Wang · ACM SIGMOD Record · 1997
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.
Cited by 223 works. doi:10.1145/253262.253291 Open-access PDF
Authors
References
- Access path selection in a relational database management system
- Probability Inequalities for Sums of Bounded Random Variables
- Implementation techniques for main memory database systems
- Providing OLAP (On-line Analytical Processing) to User-Analysts : An IT Mandate
- UNIVERSITY OF CALIFORNIA
- Statistical estimators for relational algebra expressions
- Algorithms for Computing the Sample Variance: Analysis and Recommendations
- Selectivity and Cost Estimation for Joins Based on Random Sampling
- Query processing and optimization in Oracle Rdb
- Query execution techniques for caching expensive methods