Proceedings ArticleDOI
Probabilistic Top-k query processing in distributed sensor networks
Mao Ye,Xingjie Liu,Wang-Chien Lee,Dik Lun Lee +3 more
- pp 585-588
TLDR
The sufficient set-based (SSB) algorithm for inter-cluster query processing of probabilistic Top-k queries in cluster-based wireless sensor networks is developed and Experimental results show that the proposed algorithm reduces data transmissions significantly.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.read more
Citations
More filters
Journal ArticleDOI
Distributed Database Management Techniques for Wireless Sensor Networks
TL;DR: The goal of this work is to present how data and query management techniques have advanced nowadays, but also show their benefits and drawbacks, and to identify open issues providing guidelines for further contributions in this type of distributed architectures.
Dissertation
On entity resolution in probabilistic data
TL;DR: This thesis studies the ER problem in probabilistic databases, i.e. databases in which each tuple or attribute value is associated with a probability value to, for instance, indicate its confidence level, and studies the following problems: 1) identity resolution in Probabilistic data, 2) identity Resolution in distributed probabilism data, 3) deduplication in probable data, and 4) schema matching in a fully automated setting.
Journal ArticleDOI
Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks
TL;DR: The notion of sufficient set and necessary set for distributed processing of probabilistic top-k queries in cluster-based wireless sensor networks and an adaptive algorithm that dynamically switches among the three proposed algorithms to minimize the transmission cost are introduced.
Journal ArticleDOI
Toward Efficient Distributed Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks
TL;DR: A tight upper bound on the minimum in-network processing cost is proved, and it is shown that the heuristic algorithm has better performance than a canonical greedy algorithm, and an improved distributed implementation of the algorithm is given.
Journal ArticleDOI
GDPS: An Efficient Approach for Skyline Queries over Distributed Uncertain Data☆
TL;DR: This paper extensively study the distributed probabilistic skyline query problem and proposes an efficient approach GDPS to address the problem with an optimized iterative feedback mechanism based on the grid summary.
References
More filters
Journal ArticleDOI
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
TL;DR: This work presents the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments, and discusses a variety of optimizations for improving the performance and fault tolerance of the basic solution.
Proceedings ArticleDOI
Top-k Query Processing in Uncertain Databases
TL;DR: A framework that encapsulates a state space model and efficient query processing techniques to tackle the challenges of uncertain data settings is constructed and it is proved that the techniques are optimal in terms of the number of accessed tuples and materialized search states.
Proceedings ArticleDOI
Ranking queries on uncertain data: a probabilistic threshold approach
TL;DR: An efficient exact algorithm, a fast sampling algorithm, and a Poisson approximation based algorithm are presented for answering probabilistic threshold top-k queries on uncertain data, which computes uncertain records taking a probability of at least p to be in the top- k list.
Proceedings ArticleDOI
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Graham Cormode,Feifei Li,Ke Yi +2 more
TL;DR: This work is able to prove that, in contrast to all existing approaches, the expected rank satisfies all the required properties for a ranking query, and provides efficient solutions to compute this ranking across the major models of uncertain data, such as attribute-level and tuple-level uncertainty.
Journal ArticleDOI
Sliding-window top-k queries on uncertain streams
TL;DR: This paper designs a unified framework for processing sliding-window top-k queries on uncertain streams, and shows that all the existing top-K definitions in the literature can be plugged into this framework, resulting in several succinct synopses that use space much smaller than the window size.