ACM Home Page
Please provide us with feedback. Feedback
Multiple aggregations over data streams
Full text PdfPdf (403 KB)
Source International Conference on Management of Data archive
Proceedings of the 2005 ACM SIGMOD international conference on Management of data table of contents
Baltimore, Maryland
SESSION: Research papers: stream aggregation table of contents
Pages: 299 - 310  
Year of Publication: 2005
ISBN:1-59593-060-4
Authors
Rui Zhang  National Univ. of Singapore
Nick Koudas  Univ. of Torontó
Beng Chin Ooi  National Univ. of Singapore
Divesh Srivastava  AT&T Labs-Research
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 63,   Citation Count: 7
Additional Information:

abstract   references   cited by   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/1066157.1066192
What is a DOI?

ABSTRACT

Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. The need for exploratory IP traffic data analysis naturally leads to posing related aggregation queries on data streams, that differ only in the choice of grouping attributes. In this paper, we address this problem of efficiently computing multiple aggregations over high speed data streams, based on a two-level LFTA/HFTA DSMS architecture, inspired by Gigascope.Our first contribution is the insight that in such a scenario, additionally computing and maintaining fine-granularity aggregation queries (phantoms) at the LFTA has the benefit of supporting shared computation. Our second contribution is an investigation into the problem of identifying beneficial LFTA configurations of phantoms and user-queries. We formulate this problem as a cost optimization problem, which consists of two sub-optimization problems: how to choose phantoms and how to allocate space for them in the LFTA. We formally show the hardness of determining the optimal configuration, and propose cost greedy heuristics for these independent sub-problems based on detailed analyses. Our final contribution is a thorough experimental study, based on real IP traffic data, as well as synthetic data, to demonstrate the effectiveness of our techniques for identifying beneficial configurations.


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.

 
1
A. Arasu, et al. STREAM: The Stanford stream data manager. IEEE Data Engineering Bulletin, 26(1):19--26, 2003.
 
2
A. Arasu and J. Widom. Resource sharing in continuous sliding-window aggregates. In VLDB, 2004.
3
 
4
D. Carney, et al. Monitoring streams - a new class of data management applications. In VLDB, 2002.
 
5
S. Chandrasekaran, et al. TelegraphCQ: Continuous dataflow processing for an uncertain world. In CIDR, 2003.
 
6
S. Chandrasekaran and M. J. Franklin. Streaming queries over streaming data. In VLDB, 2002.
7
8
 
9
A. Dobra, M. N. Garofalakis, J. Gehrke, and R. Rastogi. Sketch-based multi-query processing over data streams. In EDBT, 2004.
 
10
M. Dwass. Probability and statistics: an undergraduate course. W. A. Benjamin, 1970.
11
 
12
W. Feller. An introduction to probability theory and its applications, volume I. John Wiley & Sons, Inc, 1968.
 
13
A. Gupta and I. S. Mumick. Maintenance of materialized views: Problems, techniques and applications. IEEE Data Engineering Bulletin, 18(2), June 1995. Special Issue on Materialized Views and Data Warehousing.
14
 
15
N. Koudas and D. Srivastava. Data stream query processing: A tutorial. In VLDB, 2003.
16
17
18
 
19
M. Sullivan and A. Heybey. Tribeca: A system for managing large databases of network traffic. In USENIX, 1998.

CITED BY  7
Collaborative Colleagues:
Rui Zhang: colleagues
Nick Koudas: colleagues
Beng Chin Ooi: colleagues
Divesh Srivastava: colleagues