Lars Arge

(Approximate) Uncertain Skylines

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

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
Original languageEnglish
JournalTheory of Computing Systems
Volume52
Issue3
Pages (from-to)342-366
Number of pages25
ISSN1432-4350
DOIs
Publication statusPublished - 2013

    Research areas

  • dat structures, approximation algorithms, computational geometry

See relations at Aarhus University Citationformats

ID: 51981009