Continuous Probabilistic Reverse Skyline Monitoring over Uncertain Data Streams

2013 ◽  
Vol 380-384 ◽  
pp. 2681-2686
Author(s):  
Yong Tao Yang ◽  
Yi Jie Wang ◽  
Min Guo ◽  
Xiao Yong Li

Reverse skyline is useful for supporting many applications, such as marketing decision,environmental monitoring. Since the uncertainty of data is inherent in many scenarios, there is a needfor processing probabilistic reverse skyline queries. In this paper, we study the problem of efficientlyprocessing these queries on uncertain data streams. We first show the formal definitions of reverseskyline probability and probabilistic reverse skyline. Then we propose a new algorithm called CPRSto maintain the most recent N uncertain data elements and to process continuous queries on them.CPRS is based on R-tree, and efficient pruning techniques, one of which is based on a new structurenamed Characteristic Rectangle, are incorporated into it to handling the extra computing complexityarising from the uncertainty of data. Finally, extensive experiments demonstrate that our techniquesare very efficient in handling uncertain data streams.

Author(s):  
Guoqing Xiao ◽  
Kenli Li ◽  
Xu Zhou ◽  
Keqin Li

With the rapid development of data collection methods and their practical applications, the management of uncertain data streams has drawn wide attention in both academia and industry. System capacity planning and Quality of service (QoS) metrics are two very important problems for data stream management systems (DSMSs) to process streams efficiently due to unpredictable input characteristics and limited memory resource in the system. Motivated by this, in this paper, we explore an effective approach to estimate the memory requirement, data loss ratio, and tuple latency of continuous queries for uncertain data streams over sliding windows in a DSMS. More specifically, we propose a queueing model to address these problems in this paper. We study the average number of tuples, average tuple latency in the queue, and the distribution of the number of tuples and tuple latency in the queue under the Poisson arrival of input data streams in our queueing model. Furthermore, we also determine the maximum capacity of the queueing system based on the data loss ratio. The solutions for the above problems are very important to help researchers design, manage, and optimize a DSMS, including allocating buffer needed for a queue and admitting a continuous uncertain query to the system without violation of the pre-specified QoS requirements.


2012 ◽  
Vol 184 (1) ◽  
pp. 196-214 ◽  
Author(s):  
Xiaofeng Ding ◽  
Xiang Lian ◽  
Lei Chen ◽  
Hai Jin

Sign in / Sign up

Export Citation Format

Share Document