The Community for Technology Leaders
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010) (2010)
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.
INDEX TERMS
CITATION

W. Lee, D. L. Lee, M. Ye and X. Liu, "Probabilistic Top-k query processing in distributed sensor networks," 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)(ICDE), Long Beach, CA, USA, 2010, pp. 585-588.
doi:10.1109/ICDE.2010.5447875
82 ms
(Ver 3.3 (11022016))