This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)
Probabilistic Top-k query processing in distributed sensor networks
Long Beach, CA, USA
March 01-March 06
ISBN: 978-1-4244-5445-7
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
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, pp.585-588, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010
Usage of this product signifies your acceptance of the Terms of Use.