Incorporating constraints in probabilistic XML

ACM Transactions on Database Systems

Volumn 34, Issue 3, 2009, Pages

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

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Constraints; Probabilistic databases; Probabilistic XML; Sampling probabilistic data

Indexed keywords

AGGREGATE FUNCTION; CONSTRAINTS; DATA INTEGRITY; DATA ITEMS; PROBABILISTIC DATABASES; PROBABILISTIC INTERPRETATION; PROBABILISTIC XML; QUERY EVALUATION;

DATABASE SYSTEMS; XML;

MARKUP LANGUAGES;

EID: 70349104151     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1567274.1567280     Document Type: Article

References (36)

1. ABITEBOUL, S., KIMELFELD, B., SAGIV, Y., AND SENELLART, P. 2009. On the expressiveness of probabilistic XML models. VLDB J.
2. ABITEBOUL, S. AND SENELLART, P. 2006. Querying and updating probabilistic information in XML. In Proceedings of the International Conference on Extending Database Technology (EDBT). Springer, 1059-1068. (Pubitemid 43986868)
3. BIDOIT, N. AND COLAZZO, D. 2007. Testing XML constraint satisfiability. Electr. Notes Theor. Comput. Sci. 174, 6, 45-61.
4. BRUNO, N., KOUDAS, N., AND SRIVASTAVA, D. 2002. Holistic twig joins: Optimal XML pattern matching. In Proceedings of the ACM SIGMOD Conference on Management of Data. ACM, 310-321.
5. BUNEMAN, P., DAVIDSON, S. B., FAN, W., HARA, C. S., AND TAN, W. C. 2002. Keys for XML. Comput. Netw. 39, 5, 473-487.
6. COHEN, S., KIMELFELD, B., AND SAGIV, Y. 2008. Incorporating constraints in probabilistic XML. In Proceedings of the 27th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 109-118.
7. COHEN, S., KIMELFELD, B., AND SAGIV, Y. 2009. Running tree automata on probabilistic XML. In Proceedings of the 28th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM, 227-236.
8. COOPER, G. F. 1990. The computational complexity of probabilistic inference using Bayesian belief networks. Artif. Intell. 42, 2-3, 393-405.
9. DAGUM, P. AND LUBY, M. 1993. Approximating probabilistic inference in bayesian belief networks is NP-hard. Artif. Intell. 60, 1, 141-153. (Pubitemid 23622908)
10. DALVI, N. N. AND SUCIU, D. 2004. Efficient query evaluation on probabilistic databases. In Proceedings of the International Conference on Very Large Database (VLDB). Morgan Kaufmann, 864-875.
11. DALVI, N. N. AND SUCIU, D. 2007. The dichotomy of conjunctive queries on probabilistic structures. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, 293-302.
12. FAN, W., KUPER, G. M., AND SIḾEON, J. 2002. A unified constraint model for XML. Comput. Netw. 39, 5, 489-505.
13. FAN, W. AND LIBKIN, L. 2002. On XML integrity constraints in the presence of DTDs. J. ACM 49, 3, 368-406.
14. FAN, W. AND SIḾEON, J. 2003. Integrity constraints for XML. J. Comput. Syst. Sci. 66, 1, 254-291.
15. FRICK, M. AND GROHE, M. 2002. The complexity of first-order and monadic second-order logic revisited. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, 215-224.
16. HUNG, E., GETOOR, L., AND SUBRAHMANIAN, V. S. 2003a. Probabilistic interval XML. In Proceedings of the International Conference on Database Theory (ICDT). Springer, 361-377.
17. HUNG, E., GETOOR, L., AND SUBRAHMANIAN, V. S. 2003b. PXML: A probabilistic semistructured data model and algebra. In Proceedings of the International Conference on Data Engineering (ICDE). IEEE Computer Society, 467-478.
18. KIMELFELD, B., KOSHAROVSKY, Y., AND SAGIV, Y. 2008. Query efficiency in probabilistic XML models. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 701-714.
19. KIMELFELD, B., KOSHAROVSKY, Y., AND SAGIV, Y. 2009. Query evaluation over probabilistic XML. VLDB J.
20. KIMELFELD, B. AND SAGIV, Y. 2007a. Matching twigs in probabilistic XML. In Proceedings of the International Conference on Very Large Databases (VLDB). ACM, 27-38.
21. KIMELFELD, B. AND SAGIV, Y. 2007b. Maximally joining probabilistic data. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, 303-312.
22. LI, T., SHAO, Q., AND CHEN, Y. 2006. PEPX: A query-friendly probabilistic XML database. In Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management. ACM Press, 848-849.
23. NEVEN, F. AND SCHWENTICK, T. 2002. Query automata over finite trees. Theor. Comput. Sci. 275, 1-2, 633-674.
24. NIERMAN, A. AND JAGADISH, H. V. 2002. ProTDB: Probabilistic data in XML. In Proceedings of the International Conference on Very Large Database (VLDB). ACM, 646-657.
25. PEARL, J. 1985. Bayesian networks: A model of self-activated memory for evidential reasoning. In Proceedings of the CogSci. Cognitive Science Society, University of California, Irvine, CA, 329-334.
26. PROVAN, J. S. AND BALL, M. O. 1983. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12, 4, 777-788.
27. RE, C., DALVI, N. N., AND SUCIU, D. 2007. Efficient top-k query evaluation on probabilistic data. In Proceedings of the International Conference on Data Engineering (ICDE). IEEE, 886-895.
28. RE, C. AND SUCIU, D. 2007. Efficient evaluation of HAVING queries on a probabilistic database. In Proceedings of the International Conference on Database Programming Languages (DBPL). Springer, 186-200.
29. SENELLART, P. AND ABITEBOUL, S. 2007. On the complexity of managing probabilistic XML data. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS). ACM, 283-292.
30. TAMAKI, H. AND SATO, T. 1986. OLD resolution with tabulation. In Proceedings of the International Conference on Logic Programming (ICLP). Springer, 84-98.
31. TODA, S. AND OGIWARA, M. 1992. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput. 21, 2, 316-328.
32. VAN KEULEN, M., DE KEIJZER, A., AND ALINK, W. 2005. A probabilistic XML approach to data integration. In Proceedings of the International Conference on Data Engineering (ICDE). IEEE Computer Society, 459-470.
33. WARREN, D. S. 1992. Memoing for logic programs. Comm. ACM 35, 3, 93-111.
34. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
35. ABITEBOUL, S., KANELLAKIS, P., AND GRAHNE, G. 1991. On the representation and querying of sets of possible worlds. Theor. Comput. Sci. 78, 1, 158-187.
36. ANGLES, R. AND GUTIERREZ, C. 2008. The expressive power of sparql. In Proceedings of the International Semantic Web Conference (ISWC), 114-129.