文章基本信息

标题：Fully decentralized computation of aggregates over data streams
本地全文：下载
作者：Luca Becchetti ; Ilaria Bordino ; Stefano Leonardi 等
期刊名称：SIGKDD Explorations
印刷版ISSN：1931-0145
出版年度：2011
卷号：12
期号：2
页码：83-91
DOI：10.1145/1964897.1964919
出版社：Association for Computing Machinery
摘要：In several emerging applications, data is collected in massive streams at several distributed points of observation. A basic and challenging task is to allow every node to monitor a neighbourhood of interest by issuing continuous aggregate queries on the streams observed in its vicinity. This class of algorithms is fully decentralized and diffusive in nature: collecting all data at few central nodes of the network is unfeasible in networks of low capability devices or in the presence of massive data sets. The main difficulty in designing diffusive algorithms is to cope with duplicate detections. These arise both from the observation of the same event at several nodes of the network and/or receipt of the same aggregated information along multiple paths of diffusion. In this paper, we consider fully decentralized algorithms that answer locally continuous aggregate queries on the number of distinct events, total number of events and the second frequency moment in the scenario outlined above. The proposed algorithms use in the worst case or on realistic distributions sublinear space at every node. We also propose strategies that minimize the communication needed to update the aggregates when new events are observed. We experimentally evaluate for the efficiency and accuracy of our algorithms on realistic simulated scenarios.