Probabilistic Top- ${k}$ Dominating Query Monitoring Over Multiple Uncertain IoT Data Streams in Edge Computing Environments

  title={Probabilistic Top- \$\{k\}\$ Dominating Query Monitoring Over Multiple Uncertain IoT Data Streams in Edge Computing Environments},
  author={Chuan-Chi Lai and Tien-Chun Wang and Chuan-Ming Liu and Li-Chun Wang},
  journal={IEEE Internet of Things Journal},
Extracting the valuable features and information in big data has become one of the important research issues in data science. In most Internet of Things (IoT) applications, the collected data are uncertain and imprecise due to sensor device variations or transmission errors. In addition, the sensing data may change as time evolves. We refer an uncertain data stream as a dataset that has velocity, veracity, and volume properties simultaneously. This paper employs the parallelism in edge… Expand
Efficient and Robust Top-k Algorithms for Big Data IoT
This paper considers the distributed approximate top-k processing algorithms dedicated to the IoT-based networks and proposes a safety-based fault-tolerance notation and contributes to improving a known algorithm in terms of accuracy. Expand
Cloud-Edge Orchestration for the Internet of Things: Architecture and AI-Powered Data Processing
  • Yulei Wu
  • Computer Science
  • IEEE Internet of Things Journal
  • 2021
This article first introduces a kind of computing architecture from the perspective of IoT applications, then investigates the state-of-the-art proposals on AI-powered cloud-edge orchestration for the IoT and identifies potential research challenges and open issues. Expand
Highly Efficient Indexing Scheme for k-Dominant Skyline Processing over Uncertain Data Streams
  • Chuan-Chi Lai, Hsuan-Yu Lin, Chuan-Ming Liu
  • Computer Science
  • 2021 30th Wireless and Optical Communications Conference (WOCC)
  • 2021
An effective method is proposed, Middle Indexing (MI), which filters out a large amount of irrelevant data in the uncertain data stream by sorting data specifically, so as to improve the efficiency of updating the k-dominant skyline. Expand
RPC: Representative possible world based consistent clustering algorithm for uncertain data
This paper proposes a representative possible world based consistent clustering (RPC) algorithm for uncertain data and integrates a consistency learning procedure into spectral clustering to deal with the representative possible worlds synergistically, thus utilizing the consistency to achieve better performance. Expand
QoS Driven Task Offloading and Resource Allocation at Edge Servers in RAN Slicing
This paper proposes an ensemble method for classifying through Multiple Attribute Decision Making (MADM), Single Attribute Categorization (SAC), and fuzzy rules, and presents a probabilistic, priority-driven Kafka-topic consumer which schedules the offloaded tasks in the edge containers. Expand
Skylines and Other Dominance-Based Queries
This book is a gentle introduction to dominance-based query processing techniques and their applications and aims to present fundamental as well as some advanced issues in the area. Expand
Probabilistic Skyline Query Processing over Uncertain Data Streams in Edge Computing Environments
This paper proposes a new algorithm for processing probabilistic skyline queries over uncertain data streams in an edge computing environment that reduces the response time by more than 50% compared with the brute force method on two-dimensional data but also maintains the leading processing speed on high-dimensionalData. Expand


Continuous Monitoring of Top-k Dominating Queries over Uncertain Data Streams
This work formally defines the problem of continuous probabilistic top-k dominating (PTOPK) query processing over uncertain data streams based on a count-based sliding window model and proposes an efficient postponed examination algorithm (PEA) to solve the problem. Expand
Identifying Top k Dominating Objects over Uncertain Data
The top k dominating model is formally introduced based on the state-of-the-art top k semantic over uncertain data and novel pruning techniques are proposed by utilizing the spatial indexing and statistic information, which significantly improve the performance of the algorithms in terms of CPU and I/O costs. Expand
A survey of queries over uncertain data
This paper presents and analyzes several typical uncertain queries, such as skyline queries, top-$$k$$ queries, nearest-neighbor queries, aggregate queries, join queries, range queries, and threshold queries over uncertain data, and summarizes the main features of uncertain queries. Expand
Sliding window top-k dominating query processing over distributed data streams
Two algorithms are presented that monitor the exact top-k dominating data and efficiently eliminate unqualified data objects for the result, which reduces both communication and computation costs. Expand
An Effective Probabilistic Skyline Query Process on Uncertain Data Streams
This paper proposes an effective approach, Efficient Probabilistic Skyline Update (EPSU), using a new data structure by augmenting the R-tree structure and shows that EPSU can effectively compute the probabilistic skyline query in terms of the time and space and outperforms the existing ones. Expand
Top-k Dominating Queries on Incomplete Data
This paper carries out a systematic study of TKD queries on incomplete data, which involves the data having some missing dimensional value(s), and proposes a suite of efficient algorithms for answering TkD queries over incomplete data. Expand
Space Filling Approach for Distributed Processing of Top-k Dominating Queries
An efficient decentralized algorithm that exploits virtual points and returns the exact answer is proposed, which is utilized to focus on the data space to be preferentially searched and also to limit the search space to prune unnecessary computation and data forwarding. Expand
Finding Top- $k$ Dominance on Incomplete Big Data Using MapReduce Framework
The proposed MapReduced Enhanced Bitmap Index Guided Algorithm (MRBIG) uses the MapReduce framework to enhance the performance of applying top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-Math></inline- formula> dominance queries on large incomplete datasets. Expand
Threshold-based probabilistic top-k dominating queries
This paper formally defines the problem of efficiently computing top-k dominating queries on uncertain data, and develops an efficient, threshold-based algorithm to compute the exact solution and an efficient randomized algorithm with an accuracy guarantee. Expand
Continuous monitoring of top-k queries over sliding windows
This paper presents two processing techniques: the first one computes the new answer of a query whenever some of the current top-k points expire; the second one partially pre-computes the future changes in the result, achieving better running time at the expense of slightly higher space requirements. Expand