作者: Peyman Afshani , Pankaj K. Agarwal , Lars Arge , Kasper Green Larsen , Jeff M. Phillips
DOI: 10.1007/S00224-012-9382-7
关键词:
摘要: Given a set of points with uncertain locations, we consider the problem computing probability each point lying on skyline, that is, it is not dominated by any other input point. If point's uncertainty described as distribution over discrete improve best known exact solution. We also suggest why believe our solution might be optimal. Next, describe simple, near-linear time approximation algorithms for skyline. In addition, some methods can adapted to construct data structures efficiently determine query