Continuous monitoring of top-k dominating queries over uncertain data streams

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In many scenarios, e.g., environmental monitoring using multiple sensors, the uncertain data objects arrive continuously (online) and need to be processed in a streaming manner. We first formally define the problem of continuous probabilistic top-k dominating (PTOPK) query processing over uncertain data streams based on a count-based sliding window model. Based on the observation that PTOPK does not change dramatically in consequent sliding window and most uncertain data objects not in PTOPK cannot be inserted in PTOPK in a certain period of time, an efficient postponed examination algorithm (PEA) is proposed. With PEA, the scores calculation for some uncertain data objects not in PTOPK can be postponed and the computation cost can be saved. Extensive experiments have been conducted to demonstrate the efficiency of our approaches.

Cite

CITATION STYLE

APA

Li, G., Luo, C., & Li, J. (2014). Continuous monitoring of top-k dominating queries over uncertain data streams. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8786, 244–255. https://doi.org/10.1007/978-3-319-11749-2_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free