The Community for Technology Leaders
RSS Icon
Subscribe
Long Beach, CA, USA
Mar. 1, 2010 to Mar. 6, 2010
ISBN: 978-1-4244-5445-7
pp: 585-588
Mao Ye , Department of Computer Science&Engineering, The Pennsylvania State University, USA
Xingjie Liu , Department of Computer Science&Engineering, The Pennsylvania State University, USA
Wang-Chien Lee , Department of Computer Science&Engineering, The Pennsylvania State University, USA
Dik Lun Lee , Department of Computer Science&Engineering, Hong Kong University of Science and Technology, China
ABSTRACT
In this paper, we propose the notion of sufficient set for distributed processing of probabilistic Top-k queries in cluster-based wireless sensor networks. Through the derivation of sufficient boundary, we show that data items ranked lower than sufficient boundary are not required for answering the probabilistic top-k queries, thus are subject to local pruning. Accordingly, we develop the sufficient set-based (SSB) algorithm for inter-cluster query processing. Experimental results show that the proposed algorithm reduces data transmissions significantly.
CITATION
Mao Ye, Xingjie Liu, Wang-Chien Lee, Dik Lun Lee, "Probabilistic Top-k query processing in distributed sensor networks", ICDE, 2010, 2013 IEEE 29th International Conference on Data Engineering (ICDE), 2013 IEEE 29th International Conference on Data Engineering (ICDE) 2010, pp. 585-588, doi:10.1109/ICDE.2010.5447875
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool