TY - GEN
T1 - Probabilistic top-κ query processing in distributed sensor networks
AU - Ye, Mao
AU - Liu, Xingjie
AU - Lee, Wang Chien
AU - Lee, Dik Lun
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77952765703&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952765703&partnerID=8YFLogxK
U2 - 10.1109/ICDE.2010.5447875
DO - 10.1109/ICDE.2010.5447875
M3 - Conference contribution
AN - SCOPUS:77952765703
SN - 9781424454440
T3 - Proceedings - International Conference on Data Engineering
SP - 585
EP - 588
BT - 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings
T2 - 26th IEEE International Conference on Data Engineering, ICDE 2010
Y2 - 1 March 2010 through 6 March 2010
ER -