DMCA
Online Aggregation (1997)
Cached
Download Links
- [s2k-ftp.cs.berkeley.edu:8000]
- [www.cs.berkeley.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 379 - 43 self |
BibTeX
@INPROCEEDINGS{Hellerstein97onlineaggregation,
author = {Joseph M. Hellerstein and Peter J. Haas and Helen J. Wang},
title = {Online Aggregation},
booktitle = {},
year = {1997},
pages = {171--182}
}
Share
 |
 |
 |
 |
||
OpenURL
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. 1 Introduction Aggregation is an incre...
Keyphrases
online aggregation performance requirement long period batch mode random order introduction aggregation database system large volume new online aggregation interface traditional database system relative rate confidence interval final answer archaic approach initial implementation different aggregate aggregation query
