Matching twigs in probabilistic XML

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 27-38

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

DATA COMPLEXITY; PROBABILISTIC DATA; PROBABILISTIC XML; PROBABILITY THRESHOLD; SUB-ELEMENT; TWIG QUERIES; XML DATA;

XML;

EID: 85011088600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. In EDBT, 2006.
2. D. Barbará, H. Garcia-Molina, and D. Porter. The management of probabilistic data. IEEE Trans. Knowl. Data Eng., 4(5), 1992.
3. R. Cavallo and M. Pittarelli. The theory of probabilistic databases. In P. M. Stocker, W. Kent, and P. Hammersley, editors, VLDB, 1987.
4. S. Cohen, I. Fadida, Y. Kanza, B. Kimelfeld, and Y. Sagiv. Full disjunctions: Polynomial-delay iterators in action. In VLDB, 2006.
5. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. In PODS, 2005.
6. S. Cohen and Y. Sagiv. An incremental algorithm for computing ranked full disjunctions. To appear in J. Comput. Syst. Sci. (an extended version of [5]), 2006.
7. N. N. Dalvi. Query evaluation on a database given by a random graph. In ICDT, 2007.
8. N. N. Dalvi, G. Miklau, and D. Suciu. Asymptotic conditional probabilities for conjunctive queries. In ICDT, 2005.
9. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
10. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, 2007.
11. D. Dey and S. Sarkar. A probabilistic relational model and algebra. ACM Trans. Database Syst., 21(3), 1996.
12. C. A. Galindo-Legaria. Outerjoins as disjunctions. In SIGMOD, 1994.
13. E. Grädel, Y. Gurevich, and C. Hirsch. The complexity of query reliability. In PODS. ACM Press, 1998.
14. E. Hung, L. Getoor, and V. S. Subrahmanian. Probabilistic interval XML. In ICDT, 2003.
15. E. Hung, L. Getoor, and V. S. Subrahmanian. PXML: A probabilistic semistructured data model and algebra. In ICDE, 2003.
16. D. Johnson, M. Yannakakis, and C. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27, 1988.
17. Y. Kanza, W. Nutt, and Y. Sagiv. Querying incomplete information in semistructured data. J. Comput. Syst. Sci., 64(3), 2002.
18. Y. Kanza and Y. Sagiv. Computing full disjunctions. In PODS. ACM, 2003.
19. B. Kimelfeld and Y. Sagiv. Combining incompleteness and ranking in tree queries. In ICDT, 2007.
20. B. Kimelfeld and Y. Sagiv. Maximally joining probabilistic data. In PODS, 2007.
21. A. Nierman and H. V. Jagadish. ProTDB: Probabilistic data in XML. In VLDB, 2002.
22. C. H. Papadimitriou and M. Yannakakis. On the complexity of database queries. In PODS. ACM, 1997.
23. 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.
24. A. Rajaraman and J. D. Ullman. Integrating information by outerjoins and full disjunctions. In PODS, 1996.
25. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In PODS, 2007.
26. S. Toda and M. Ogiwara. Counting classes are at least as hard as the polynomial-time hierarchy. SIAM J. Comput., 21(2), 1992.