Abstract
Computing the skyline probability of an object for a database, wherein the probability of preferences between pairs of data objects are uncertain, requires computing the probability of union of events from the probabilities of all possible joint probabilities. From the literature it can be seen that for a database of size n it requires computation of 2n joint probabilities of all possible combinations. All known algorithms for probabilistic skyline computation over uncertain preferences attempt to find inexact value of skyline probability by resorting to sampling or to approximation schemes. In this paper we use a concept called zero-contributing set of a power set lattice to denote portion of the lattice (a sub-lattice) such that the signed aggregate of joint probabilities corresponding to this set is zero. When such sets can be implicitly identified, the corresponding terms can be removed, saving substantial computational efforts. We propose an efficient heuristic that employs a bi-directional search traversing level wise the power set lattice from top and from bottom and prunes the exponential search space based on zero-contribution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Atallah, M.J., Qi, Y., Yuan, H.: Asymptotically efficient algorithms for skyline probabilities of uncertain data. ACM Trans. Database Syst. 36(2), 12 (2011)
Bartolini, I., Ciaccia, P., Patella, M.: The skyline of a probabilistic relation. IEEE Trans. Knowl. Data Eng. 25(7), 1656–1669 (2013)
Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 421–430 (2001)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE, pp. 717–719 (2003)
Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting: Theory and optimizations. In: Intelligent Information Systems, pp. 595–604 (2005)
Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. VLDB, 229–240 (2005)
Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. VLDB, 275–286 (2002)
Lian, X., Chen, L.: Reverse skyline search in uncertain databases. ACM Trans. Database Syst. 35(1) (2010)
Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. 30(1), 41–82 (2005)
Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. VLDB, 15–26 (2007)
Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient progressive skyline computation. VLDB, 301–310 (2001)
Tan, P.-N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley (2005)
Zhang, Q., Ye, P., Lin, X., Zhang, Y.: Skyline probability over uncertain preferences. In: EDBT/ICDT, pp. 395–405 (2013)
Zhang, W., Lin, X., Zhang, Y., Cheema, M.A., Zhang, Q.: Stochastic skylines. ACM Trans. Database Syst. 37(2), 14 (2012)
Zhang, W., Lin, X., Zhang, Y., Wang, W., Yu, J.X.: Probabilistic skyline operator over sliding windows. In: ICDE, pp. 1060–1071 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Pujari, A.K., Kagita, V.R., Garg, A., Padmanabhan, V. (2015). Bi-directional Search for Skyline Probability. In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-14974-5_24
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14973-8
Online ISBN: 978-3-319-14974-5
eBook Packages: Computer ScienceComputer Science (R0)