A space-bounded extreme aggregation of data stream is proposed over time-based sliding window to reduce the vast space of traditional methods under the worst cases. When the number of candidates reaches a given threshold
the method would randomly sample the new arrival tuples in the window to maintain limited candidates and continuously return approximate extremes. A space-bounded synopsis structure REx-link is designed to maintain extreme candidates by random sampling in memory
and to implement extreme aggregation over time-based sliding window. It is proved that an upper bound for the error probability of the random algorithm exists. Comprehensive experiments are performed to analyze the accuracy between returned results and exact solutions
and the results show that the tradeoff between the accuracy and the space overhead is acceptable in practice.
关键词
Keywords
references
CUGOLA G, MARGARA A. Processing flows of information: from data stream to complex event processing [R]. Politecnico di Milano, Italy: Dip. di Electronica e Informazione, 2010.
RAJARAMAN A, ULLMAN J. Mining of massive datasets [M]. Cambridge, UK: Cambridge University Press, 2011.
LIU Zhenyu, SIA K C, CHO J. Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertainty [C]∥Proceedings of the 2005 ACM Symposium on Applied Computing. New York, USA: ACM, 2005: 634-641.
SILBERSTEIN A, MUNAGALA K, YANG Jun. Energy-efficient monitoring of extreme values in sensor networks [C]∥Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data. New York, USA: ACM, 2006: 169-180.
DENG Hanlin, ZHANG Baoxian, LI Cheng, et al. MAX-MIN aggregation in wireless sensor networks: mechanism and modeling [J]. Wireless Communications and Mobile Computing, 2010, 12: 615-630.
PENG Xiaoming, HE Yanxiang, TIAN Li. Communication reduction for continuous extreme values monitoring over distributed data streams [C]∥Proceedings of the Workshop on Power Electronics and Intelligent Transportation System. Washington, DC, USA: IEEE Computer Society, 2008: 181-187.
CORMEN T, LEISERSON C, RIVEST R, et al. Introduction to algorithms [M]. Cambridge, MA, USA: The MIT Press, 2001.