Continuous probabilistic skyline queries for uncertain moving objects

In this paper, an efficient algorithm U-CPSQ is used to handle continuous probabilistic skyline queries. The main idea is as following: Firstly, according to the new probabilistic dominance relation defined in this paper, it is possible for us to compute the skyline probability for any points and get the initial p-skyline. Secondly, two types of events affecting p-skyline are defined, by tracking and calculating those events, the p-skyline can be updated with high-speed. An extensive experiment has been conducted which indicates that our algorithm is efficient. To the best of our knowledge, this is the first work on continuous probabilistic skyline queries for uncertain moving objects.