Abstract
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.
Similar content being viewed by others
Notes
We remark that the running times mentioned above bound the number of arithmetic operations performed by the algorithms and not the bit complexity.
The step above is the reason why we maintain π(v), χ(v) instead of .
References
Afshani, P., Agarwal, P.K., Arge, L., Larsen, K.G., Phillips, J.M.: (Appoximate) uncertain skylines. In: 14th International Conference on Database Theory (2011)
Agarwal, P.K., Sharir, M.: Arrangements of surfaces in higher dimensions. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 49–119. North-Holland, Amsterdam (2000)
Agrawal, P., Benjelloun, O., Sarma, A.D., Hayworth, C., Nabar, S., Sugihara, T., Widom, J.: Trio: a system for data, uncertainty, and lineage. In: ACM Symposium on Principles of Database Systems (2006)
Atallah, M.J., Qi, Y.: Computing all skyline probabilities for uncertain data. In: ACM Symposium on Principles of Database Systems, pp. 279–287 (2009)
Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509–517 (1975)
Boissonnat, J.-D., Sharir, M., Tagansky, B., Yvinec, M.: Voronoi diagrams in higher dimensions under certain polyhedral distance functions. Discrete Comput. Geom. 19, 485–519 (1998)
Börzsönyi, S., Kossman, D., Stocker, K.: The skyline operator. In: IEEE International Conference on Data Engineering (2001)
Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: ACM-SIGMOD International Conference on Management of Data (2006)
Cheng, R., Kalashnikov, D.V., Prabhakar, S.: Evaluating probabilitic queries over imprecise data. In: ACM-SIGMOD International Conference on Management of Data (2003)
Cormode, G., Garafalakis, M.: Histograms and wavelets of probabilitic data. In: IEEE International Conference on Data Engineering (2009)
Cormode, G., Deligiannakis, A., Garafalakis, M., McGregor, A.: Probabilistic histograms for probabilistic data. In: International Conference on Very Large Data Bases (2009)
Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: IEEE International Conference on Data Engineering (2009)
Dalvi, N., Suciu, D.: Efficient query evaluation on probabilitic databases. VLDB J. 16, 523–544 (2007)
Das Sarma, A., Lall, A., Nanongkai, D., Xu, J.: Randomized multi-pass streaming skyline algorithms. In: International Conference on Very Large Data Bases (2009)
Das Sarma, A., Lall, A., Nanongkai, D., Lipton, R.J., Xu, J.: Representative skylines using threshold-based preference distributions. In: IEEE International Conference on Data Engineering (2011)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry Algorithms and Applications. Springer, Berlin (2008)
Edelsbunner, H., Guibas, L.J., Stolfi, J.: Optimal point location on a monotone subdivision. SIAM J. Comput. 15, 317–340 (1986)
Koltun, V., Papadimitriou, C.H.: Approximately dominating representatives. Theor. Comput. Sci. 371, 148–154 (2007)
Kossman, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an optimal algorithm for skyline queries. In: International Conference on Very Large Data Bases (2002)
Kung, H.T., Luccio, F., Preparata, F.P.: On finding the maxima of a set of vectors. J. ACM 22(4), 469–476 (1975)
Li, J., Saha, B., Deshpande, A.: A unified approach to ranking in probabilistic databases. In: International Conference on Very Large Data Bases (2009)
Lian, X., Chen, L.: Monochromatic and bichromatic reverse skyline search over uncertain databases. In: ACM-SIGMOD International Conference on Management of Data (2008)
Löffler, M., Phillips, J.M.: Shape fitting of point sets with probability distributions. In: European Symposium on Algorithms (2009)
Löffler, M., Snoeyink, J.: Delaunay triangulations of imprecise points in linear time after preprocessing. In: Symposium on Computational Geometry, pp. 298–304 (2008)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Nanongkai, D., Das Sarma, A., Lall, A., Lipton, R.J., Xu, J.: Regret-minimizing representative databases. In: International Conference on Very Large Data Bases (2010)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: ACM-SIGMOD International Conference on Management of Data (2003)
Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: International Conference on Very Large Data Bases (2007)
Preparata, F.P., Shamos, M.I.: Computational Geometry an Introduction. Springer, Berlin (1985)
Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. In: International Conference on Very Large Data Bases (2001)
Tao, Y., Cheng, R., Xiao, X., Ngai, W.K., Kao, B., Prabhakar, S.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: International Conference on Very Large Data Bases (2005)
Willard, D.E.: New data structures for orthogonal range queries. SIAM J. Comput. 14(1), 232–253 (1985)
Zhang, W., Lin, X., Zhang, Y., Wang, W., Yu, J.X.: Probabilistic skyline operator over sliding windows. In: IEEE International Conference on Data Engineering (2009)
Author information
Authors and Affiliations
Corresponding author
Additional information
P.A. was supported by Natural Sciences and Engineering Research Council of Canada through a post-doctoral fellowship program. P.K.A. was supported by NSF under grants CNS-05-40347, IIS-07-13498, CCF-09-40671, and CCF-10-12254, by ARO grants W911NF-07-1-0376 and W911NF-08-1-0452, by an NIH grant 1P50-GM-08183-01, and by a grant from the US–Israel Binational Science Foundation. L.A. and K.G.L. were supported by MADALGO—Center for Massive Data Algorithmics—a Center of the Danish National Research Foundation. K.G.L. was also supported in part by a Google Europe Fellowship in Search and Information Retrieval. J.M.P. was supported by subaward CIF-32 from NSF grant 0937060 to CRA and subaward CIF-A-32 from NSF grant 1019343 to CRA.
Rights and permissions
About this article
Cite this article
Afshani, P., Agarwal, P.K., Arge, L. et al. (Approximate) Uncertain Skylines. Theory Comput Syst 52, 342–366 (2013). https://doi.org/10.1007/s00224-012-9382-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-012-9382-7