Probabilistic top-κ query processing in distributed sensor networks

Mao Ye, Xingjie Liu, Wang-chien Lee, Dik Lun Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publication26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings
Pages585-588
Number of pages4
DOIs
StatePublished - Jun 1 2010
Event26th IEEE International Conference on Data Engineering, ICDE 2010 - Long Beach, CA, United States
Duration: Mar 1 2010Mar 6 2010

Publication series

NameProceedings - International Conference on Data Engineering
ISSN (Print)1084-4627

Other

Other26th IEEE International Conference on Data Engineering, ICDE 2010
CountryUnited States
CityLong Beach, CA
Period3/1/103/6/10

Fingerprint

Query processing
Sensor networks
Data communication systems
Wireless sensor networks
Processing

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Information Systems

Cite this

Ye, M., Liu, X., Lee, W., & Lee, D. L. (2010). Probabilistic top-κ query processing in distributed sensor networks. In 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings (pp. 585-588). [5447875] (Proceedings - International Conference on Data Engineering). https://doi.org/10.1109/ICDE.2010.5447875
Ye, Mao ; Liu, Xingjie ; Lee, Wang-chien ; Lee, Dik Lun. / Probabilistic top-κ query processing in distributed sensor networks. 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings. 2010. pp. 585-588 (Proceedings - International Conference on Data Engineering).
@inproceedings{974cf2ced6b94f3b85494b7d267b64dc,
title = "Probabilistic top-κ query processing in distributed sensor networks",
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.",
author = "Mao Ye and Xingjie Liu and Wang-chien Lee and Lee, {Dik Lun}",
year = "2010",
month = "6",
day = "1",
doi = "10.1109/ICDE.2010.5447875",
language = "English (US)",
isbn = "9781424454440",
series = "Proceedings - International Conference on Data Engineering",
pages = "585--588",
booktitle = "26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings",

}

Ye, M, Liu, X, Lee, W & Lee, DL 2010, Probabilistic top-κ query processing in distributed sensor networks. in 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings., 5447875, Proceedings - International Conference on Data Engineering, pp. 585-588, 26th IEEE International Conference on Data Engineering, ICDE 2010, Long Beach, CA, United States, 3/1/10. https://doi.org/10.1109/ICDE.2010.5447875

Probabilistic top-κ query processing in distributed sensor networks. / Ye, Mao; Liu, Xingjie; Lee, Wang-chien; Lee, Dik Lun.

26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings. 2010. p. 585-588 5447875 (Proceedings - International Conference on Data Engineering).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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/6/1

Y1 - 2010/6/1

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

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

ER -

Ye M, Liu X, Lee W, Lee DL. Probabilistic top-κ query processing in distributed sensor networks. In 26th IEEE International Conference on Data Engineering, ICDE 2010 - Conference Proceedings. 2010. p. 585-588. 5447875. (Proceedings - International Conference on Data Engineering). https://doi.org/10.1109/ICDE.2010.5447875