Sciweavers

Share
ICDT
2011
ACM

(Approximate) uncertain skylines

8 years 2 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not dominated by any other input point. If each point’s uncertainty is described as a probability distribution over a discrete set of locations, we improve the best known exact solution. We also suggest why we believe our solution might be optimal. Next, we describe simple, near-linear time approximation algorithms for computing the probability of each point lying on the skyline. In addition, some of our methods can be adapted to construct data structures that can efficiently determine the probability of a query point lying on the skyline.
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp
Added 29 Aug 2011
Updated 29 Aug 2011
Type Journal
Year 2011
Where ICDT
Authors Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
Comments (0)
books