Please use this identifier to cite or link to this item:
Title: Streaming multiple aggregations using phantoms
Authors: Zhang, R.
Koudas, N.
Ooi, B.C. 
Srivastava, D.
Zhou, P.
Keywords: Aggregation
Data stream
Multiple-query optimization
Issue Date: 2010
Source: Zhang, R., Koudas, N., Ooi, B.C., Srivastava, D., Zhou, P. (2010). Streaming multiple aggregations using phantoms. VLDB Journal 19 (4) : 557-583. ScholarBank@NUS Repository.
Abstract: Data streams characterize the high speed and large volume input of a new class of applications such as network monitoring, web content analysis and sensor networks. Among these applications, network monitoring may be the most compelling one-the backbone of a large internet service provider can generate 1 petabyte of data per day. For many network monitoring tasks such as traffic analysis and statistics collection, aggregation is a primitive operation. Various analytical and statistical needs naturally lead to related aggregate queries. In this article, we address the problem of efficiently computing multiple aggregations over high-speed data streams based on the two-level query processing architecture of GS, a real data stream management system deployed in AT & T. We discern that additionally computing and maintaining fine-granularity aggregations (called phantoms) has the benefit of supporting shared computation. Based on a thorough analysis, we propose algorithms to identify the best set of phantoms to maintain and determine allocation of resources (particularly, space) to compute the aggregations. Experiments show that our algorithm achieves near-optimal computation costs, which outperforms the best adapted algorithm by more than an order of magnitude. © 2010 Springer-Verlag.
Source Title: VLDB Journal
ISSN: 10668888
DOI: 10.1007/s00778-010-0180-z
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 7, 2018


checked on Jan 30, 2018

Page view(s)

checked on Mar 11, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.