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

Query evaluation with soft-key constraints

Authors Info & Claims
Published:09 June 2008Publication History

ABSTRACT

Key Violations often occur in real-life datasets, especially in those integrated from different sources. Enforcing constraints strictly on these datasets is not feasible. In this paper we formalize the notion of soft-key constraints on probabilistic databases, which allow for violation of key constraint by penalizing every violating world by a quantity proportional to the violation. To represent our probabilistic database with constraints, we define a class of markov networks, where we can do query evaluation in PTIME. We also study the evaluation of conjunctive queries on relations with soft keys and present a dichotomy that separates this set into those in PTIME and the rest which are #P-Hard.

References

  1. P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In ICDE '06, page 30, Washington, DC, USA, 2006. IEEE Computer Society. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. Antova, C. Koch, and D. Olteanu. MayBMS: Managing incomplete information with probabilistic world-set decompositions. In ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  3. D. Barbara, H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE Trans. on Knowledge and Data Eng., 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. O. Benjelloun, A. D. Sarma, A. Y. Halevy, and J. Widom. ULDBs: Databases with uncertainty and lineage. In VLDB, pages 953--964, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. O. Benjelloun, A. D. Sarma, C. Hayworth, and J. Widom. An introduction to ULDBs and the Trio system. IEEE Data Eng. Bull, 29(1):5--16, 2006.Google ScholarGoogle Scholar
  6. R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In Proceedings of VLDB, pages 71--81, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Cowell, P. Dawid, S. Lauritzen, and D. Spiegelhalter, editors. Probabilistic Networks and Expert Systems. Springer, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, pages 293--302, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In PODS '07, pages 1--12, New York, NY, USA, 2007. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. N. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In PODS, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. N. Fuhr and T. Roelleke. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst., 15(1):32--66, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Fuhr, Norbert. A probabilistic relational model for the integration of IR and databases. In SIGIR, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. L. Getoor. An introduction to probabilistic graphical models for relational data. Data Engineering Bulletin, 29(1), march 2006.Google ScholarGoogle Scholar
  15. R. Gupta, A. Diwan, and S. Sarawagi. Efficient inference with cardinality-based clique potentials. In ICML. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. I. Ilyas, V. Markl, P. Haas, P. Brown, and A. Aboulnaga. Cords: Automatic discovery of correlations and soft functional dependencies. In SIGMOD, pages 647--658, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Pearl. Probabilistic Reasoning in Intelligent Systems : Networks of Plausible Inference. Morgan Kaufmann, September 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. H. Poon and P. Domingos. Joint inference in information extraction. In AAAI, pages 913--918, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. C. Re, N. Dalvi, and D. Suciu. Efficient Top-k query evaluation on probabilistic data. In ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  20. C. Re, N. N. Dalvi, and D. Suciu. Query evaluation on probabilistic databases. IEEE Data Eng. Bull, 2006.Google ScholarGoogle Scholar
  21. C. Re and D.Suciu. Efficient evaluation of having queries on a probabilistic database. In Proceedings of DBPL, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Richardson and P. Domingos. Markov logic networks. Mach. Learn., 62(1-2):107--136, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. F. Sadri. Integrity constraints in the information source tracking method. IEEE Transactions on Knowledge and Data Engineering, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE. IEEE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  25. W. Shen, X. Li, and A. Doan. Constraint-based entity matching. In AAAI, pages 862--867, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. P. Singla and P. Domingos. Entity resolution with markov logic. In ICDM, pages 572--582, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. Staworko, J. Chomicki, and J. Marcinkowski. Preference-driven querying of inconsistent relational databases. In EDBT Workshops, pages 318--335, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410--421, 1979.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Query evaluation with soft-key constraints

                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 '08: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
                  June 2008
                  330 pages
                  ISBN:9781605581521
                  DOI:10.1145/1376916

                  Copyright © 2008 ACM

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 9 June 2008

                  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!