skip to main content
10.1145/1559795.1559837acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Computing all skyline probabilities for uncertain data

Published:29 June 2009Publication History

ABSTRACT

Skyline computation is widely used in multi-criteria decision making. As research in uncertain databases draws increasing attention, skyline queries with uncertain data have also been studied, e.g. probabilistic skylines. The previous work requires "thresholding" for its efficiency -- the efficiency relies on the assumption that points with skyline probabilities below a certain threshold can be ignored. But there are situations where "thresholding" is not desirable -- low probability events cannot be ignored when their consequences are significant. In such cases it is necessary to compute skyline probabilities of all data items. We provide the first algorithm for this problem whose worst-case time complexity is sub-quadratic. The techniques we use are interesting in their own right, as they rely on a space partitioning technique combined with using the existing dominance counting algorithm. The effectiveness of our algorithm is experimentally verified.

References

  1. V. Akrivi, A. Doulkeridis, Y. Kotidis, and M. Vazirgiannis. Skypeer: Efficient subspace skyline computation over distributed data. In ICDE, 2007.Google ScholarGoogle Scholar
  2. L. Antova, T. Jansen, C. Koch, and D. Olteanu. Fast and simple relational processing of uncertain data. In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. O. Benjelloun, A.D. Sarma, A. Halevy, and J. Widom. Uldbs: databases with uncertainty and lineage. In VLDB, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. G. Beskales, M.A. Solima, and I.F. Ilyasu. Efficient search for the top-k probable nearest neighbors in uncertain databases. In VLDB, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Borzsonyi, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Boulos, N. Dalvi, B. Mandhani, S. Mathur, C. Re, and D. Suciu. Mystiq: a system for finding more answers by using probabilities. In SIGMOD, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. B.-C. Chen, K. LeFevre, and R. Ramakrishnan. Privacy skyline: privacy with multidimensional adversarial knowledge. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Cheng, D.V. Kalashnikov, and S. Prabhakar. Evaluating probabilistic queries over imprecise data. In SIGMOD, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Cheng, D.V. Kalashnikov, and S. Prabhakar. Querying imprecise data in moving object environments. TKDE, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J.S. Vitter. Efficient indexing methods for probabilistic threshold queries over uncertain data. In VLDB, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Cheng, Y. Xia, S. Prabhakar, R. Shah, and J.S. Vitter. Probabilistic verifiers: Evaluating constrained nearest--neighbor queries over uncertain data. In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. Dellis and B. Seeger. Efficient computation of reverse skyline queries. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Hua, J. Pei, W. Zhang, and X. Lin. Ranking queries on uncertain data: A probabilistic threshold approach. In SIGMOD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. H.T. Kung, F. Luccio, and F.P. Preparata. On finding the maxima of a set of vectors. J. of ACM, 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. X. Lian and L. Chen. Monochromatic and bichromatic reverse skyline search over uncertain databases. In SIGMOD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. X. Lian and L. Chen. Probabilistic ranked queries in uncertain databases. In EDBT, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang. Selecting stars: The k most representative skyline operator. ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  18. V. Ljosa and A.K. Singh. Top-k spatial joins of probabilistic objects. In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. E.M. McCreight. Priority search trees. SIAM J. Comput., 1985.Google ScholarGoogle Scholar
  20. K. Mehlhorn. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. Springer-Verlag New York, Inc., 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. M. Morse, J.M. Patel, and H.V. Jagadish. Efficient skyline computation over low-cardinality domains. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Pei, A. W.-C. Fu, X. Lin, and H. Wang. Computing compressed multidimensional skyline cubes efficiently. ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  23. J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Singh, R. Shah, S. Prabhakar, and C. Mayfield. Database support for pdf attributes. In ICDE, 2008.Google ScholarGoogle Scholar
  26. M.A. Soliman, I.F. Ilyas, and K. C.-C. Chang. Urank: formulation and efficient evaluation of top-k queries in uncertain databases. In SIGMOD, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Y. Tao, R. Cheng, X. Xiao, W. Ngai, B. Kao, and S. Prabhakar. Indexing multi-dimensional uncertain data with arbitrary probability density functions. In VLDB, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. P. Wu, D. Agrawal, O. Egecioglu, and A. El Abbadi. Deltasky: Optimal maintenance of skyline deletions without exclusive dominance region generation. ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  29. W. Zhang, X. Lin, Y. Zhang, W. Wang, and J. Yu. Probabilistic skyline operator over sliding windows. In ICDE, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. L. Zhu, S. Zhou, and J. Guan. Efficient skyline retrieval on peer-to-peer networks. Future Generation Communication and Networking, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Computing all skyline probabilities for uncertain data

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2009
          298 pages
          ISBN:9781605585536
          DOI:10.1145/1559795
          • General Chair:
          • Jan Paredaens,
          • Program Chair:
          • Jianwen Su

          Copyright © 2009 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 June 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate476of1,835submissions,26%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!