Incorporating constraints in probabilistic XML

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2008, Pages 109-118

  Cohen, Sara ^a   Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Constraints; Probabilistic databases; Probabilistic XML; Sampling probabilistic data

Indexed keywords

AGGLOMERATION; MARKUP LANGUAGES; PROBABILITY; XML;

AGGREGATE FUNCTIONS; CONSTRAINTS; DATA INTEGRITIES; DATA ITEMS; PROBABILISTIC DATABASES; PROBABILISTIC INTERPRETATIONS; PROBABILISTIC XML; QUERY EVALUATIONS; SUB SPACES; XML DATABASES;

DATABASE SYSTEMS;

EID: 57349092467     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376933     Document Type: Conference Paper

References (24)

1. S. Abiteboul and P. Sencllart. Querying and updating probabilistic information in XML, In EDBT, 2006.
2. N. Bidoit and D. Colazzo. Testing XML constraint satisfiability. Electr. Notes Theor. Comput, Sci., 174(6), 2007.
3. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. In SIGMOD, 2002.
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.
5. G. F. Cooper. The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell, 42(2-3), 1990.
6. P. Dagum and M. Luby. Approximating probabilistic inference in bayesian belief networks is NP-hard. Artif. Intell., 60(1), 1993.
7. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
8. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, 2007.
9. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. J, ACM, 49(3), 2002.
10. W. Fan and J. Siméon. Integrity constraints for XML. J. Comput. Syst. Sci., 66(1), 2003.
11. E. Hung. L. Getoor. and V. S. Subrahmanian. Probabilistic interval XML. In ICDT, 2003.
12. E. Hung, L. Getoor, and V. S. Subrahmanian. PXML: A probabilistic semistructured data, model and algebra. In ICDE, 2003.
13. B. Kimelfeld, Y. Kosharovski, and Y. Sagiv. Query efficiency in probabilistic XML models. In SIGMOD, 2008.
14. B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic XML. In VLDB, 2007.
15. B. Kimelfeld and Y. Sagiv. Maximally joining probabilistic data. In PODS, 2007.
16. A. Nierman and H. V. Jagadish. ProTDB: Probabilistic data in XML. In VLDB, 2002.
17. J. Pearl. Bayesian networks: A model of self-activated memory for evidential reasoning. In GogSci, 1985.
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.
19. C. Re, N. N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
20. G. Re and D. Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, 2007.
21. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In PODS, 2007.
22. H. Tamaki and T. Sato. OLD resolution with tabulation. In ICLP, 1986.
23. S. Toda and M. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput., 21(2), 1992.
24. D. S. Warren. Memoing for logic programs. Commun. ACM, 35(3), 1992.