Processing frequent items over distributed data streams

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zhang, D., Li, J., Wang, W., Guo, L., & Ai, C. (2005). Processing frequent items over distributed data streams. In Lecture Notes in Computer Science (Vol. 3399, pp. 523–529). Springer Verlag. https://doi.org/10.1007/978-3-540-31849-1_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free