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

Incorporating constraints in probabilistic XML

Authors Info & Claims
Published:09 June 2008Publication History

ABSTRACT

Constraints are important not just for maintaining data integrity, but also because they capture natural probabilistic dependencies among data items. A probabilistic XML database (PXDB) is the probability sub-space comprising the instances of a p-document that satisfy a set of constraints. In contrast to existing models that can express probabilistic dependencies, it is shown that query evaluation is tractable in PXDBs. The problems of sampling and determining well-definedness (i.e., whether the above subspace is nonempty) are also tractable. Furthermore, queries and constraints can include the aggregate functions count, max, min and ratio. Finally, this approach can be easily extended to allow a probabilistic interpretation of constraints.

References

  1. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. In EDBT, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Bidoit and D. Colazzo. Testing XML constraint satisfiability. Electr. Notes Theor. Comput. Sci., 174(6), 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. In SIGMOD, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Cohen, B. Kimelfeld, and Y. Sagiv. Incorporating constraints in probabilistic XML (extended version). Can be found in the second author's home page (http://www.cs.huji.ac.il/ bennyk), 2008.Google ScholarGoogle Scholar
  5. G. F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell., 42(2-3), 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. P. Dagum and M. Luby. Approximating probabilistic inference in bayesian belief networks is NP-hard. Artif. Intell., 60(1), 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J. ACM, 49(3), 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. W. Fan and J. Siméon. Integrity constraints for XML. J. Comput. Syst. Sci., 66(1), 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. E. Hung, L. Getoor, and V. S. Subrahmanian. Probabilistic interval XML. In ICDT, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. E. Hung, L. Getoor, and V. S. Subrahmanian. PXML: A probabilistic semistructured data model and algebra. In ICDE, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  13. B. Kimelfeld, Y. Kosharovski, and Y. Sagiv. Query efficiency in probabilistic XML models. In SIGMOD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic XML. In VLDB, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Kimelfeld and Y. Sagiv. Maximally joining probabilistic data. In PODS, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. A. Nierman and H. V. Jagadish. ProTDB: Probabilistic data in XML. In VLDB, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Pearl. Bayesian networks: A model of self-activated memory for evidential reasoning. In CogSci, 1985.Google ScholarGoogle Scholar
  18. J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput., 12(4), 1983.Google ScholarGoogle ScholarCross RefCross Ref
  19. C. Re, N. N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  20. C. Re and D. Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In PODS, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. H. Tamaki and T. Sato. OLD resolution with tabulation. In ICLP, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. S. Toda and M. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput., 21(2), 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. D. S. Warren. Memoing for logic programs. Commun. ACM, 35(3), 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Incorporating constraints in probabilistic XML

          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!