Processing frequent items over distributed data streams

Authors:
Dongdong Zhang;Jianzhong Li;Weiping Wang;Longjiang Guo;Chunyu Ai
Affiliations:
School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Harbin Institute of Technology, China;School of Computer Science and Technology, Heilongjiang University, China
Venue:
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Year:
2005

Citing 5
Cited 1

A simple algorithm for finding frequent elements in streams and bags

ACM Transactions on Database Systems (TODS)
Distributed top-k monitoring

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Adaptive filters for continuous queries over distributed data streams

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Dynamically maintaining frequent items over a data stream

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Approximate frequency counts over data streams

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

Distributed stream join query processing with semijoins

Distributed and Parallel Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

To improve the availability of communication bandwidth in distributed data stream systems, communication overhead should be reduced as much as possible under the constraint of the precision of queries. In this paper, a new approach is proposed to transfer data streams in distributed data stream systems. By transferring the estimated occurrence times of frequent items, instead of raw frequent items, communication overhead can be saved greatly. Meanwhile, in order to guarantee the precision of queries, the difference between the estimated and true occurrence times of each frequent item is also sent to the central stream processor. We present the algorithm of processing frequent items over distributed data streams and give the method of supporting aggregate queries over the preprocessed frequent items.