Query efficiency in probabilistic XML models

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 701-714

  Kimelfeld, Benny ^a   Kosharovsky, Yuri ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximate query evaluation; Probabilistic databases; Probabilistic XML; Query optimization; Query processing

Indexed keywords

ABSTRACTING; DATABASE SYSTEMS; INFORMATION THEORY; MARKUP LANGUAGES; QUERY PROCESSING; XML;

APPROXIMATE ALGORITHMS; APPROXIMATE QUERY EVALUATION; EFFICIENT ALGORITHMS; NATURAL EXTENSIONS; PROBABILISTIC DATABASES; PROBABILISTIC PROCESSES; PROBABILISTIC XML; QUERY EFFICIENCIES; QUERY EVALUATIONS; QUERY OPTIMIZATION; RUNNING TIMES; TWIG QUERIES;

PROBABILITY;

EID: 57149139242     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376687     Document Type: Conference Paper

References (26)

1. S. Abiteboul and P. Senellart. Querying and updating probabilistic information in XML. In EDBT, 2006.
2. N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: optimal XML pattern matching. In SIGMOD, 2002.
3. S. Cohen, B. Kimelfeld, and Y. Sagiv. Incorporating constraints in probabilistic XML. In PODS, 2008.
4. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB, 2004.
5. N. N. Dalvi and D. Suciu. The dichotomy of conjunctive queries on probabilistic structures. In PODS, 2007.
6. S. Flesca, F. Furfaro, and E. Masciari. On the minimization of Xpath queries. In VLDB, 2003.
7. E. Grädel, Y. Gurevich, and C. Hirsch. The complexity of query reliability. In PODS, 1998.
8. E. Hung, L. Getoor, and V. S. Subrahmanian. Probabilistic interval XML. In ICDT, 2003.
9. E. Hung, L. Getoor, and V. S. Subrahmanian. PXML: A probabilistic semistructurcd data model and algebra. In ICDE, 2003.
10. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Information Processing Letters, 27, March 1988.
11. R. M. Karp, M. Luby, and N. Madras. Monte-carlo approximation algorithms for enumeration problems. J. Algorithms, 10(3), 1989.
12. B. Kimelfeld and Y. Sagiv. Matching twigs in probabilistic XML. In VLDB, 2007.
13. B. Kimelfeld and Y. Sagiv. Maximally joining probabilistic data. In PODS, 2007.
14. B. Kimelfeld and Y. Sagiv. Revisiting redundancy and minimization in an XPath fragment. In EDBT, 2008.
15. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In PODS, Madison, Wisconsin, USA, 2002.
16. A. Nierman and H. V. Jagadish. ProTDB: Probabilistic data in XML. In VLDB, 2002.
17. 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.
18. C. Re, N. N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In ICDE, 2007.
19. C. Re and D. Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, 2007.
20. C. Ré and D. Suciu. Efficient evaluation of HAVING queries on a probabilistic database. In DBPL, 2007.
21. P. Senellart. Comprendre le Web caché. Understanding the Hidden Web. PhD thesis, Université Paris-Sud 11, Orsay, France, Dec. 2007.
22. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic XML data. In PODS, 2007.
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. L. G. Valiant. The complexity of computing the permanent. Theor. Comput. Sci., 8, 1979.
25. D. S. Warren. Mcmoing for logic programs. Commun. ACM, 35(3), 1992.
26. S. Zachos. Probabilistic quantifiers and games. J. Comput. Syst. Sci., 36(3), 1988.