Revisiting redundancy and minimization in an XPath fragment

Advances in Database Technology - EDBT 2008 - 11th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2008, Pages 61-72

  Kimelfeld, Benny ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; THEOREM PROVING;

DESCENDANT EDGES; XPATH;

QUERY LANGUAGES;

EID: 43349087909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1353343.1353355     Document Type: Conference Paper

References (13)

1. S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Tree pattern query minimization. VLDB J., 11(4), 2002.
2. E. P. F. Chan. Containment and minimization of positive conjunctive queries in OODB's. In PODS, 1992.
3. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, 1977.
4. S. Flesca, F. Furfaro, and E. Masciari. On the minimization of Xpath queries. In VLDB, 2003.
5. S. Flesca, F. Furfaro, and E. Masciari. On the minimization of Xpath queries. A paper in press, 2007.
6. G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1), 2004.
7. T. Milo and D. Suciu. Index structures for path expressions. In ICDT, 1999.
8. F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3), 2006.
9. P. Ramanan. Efficient algorithms for minimizing tree pattern queries. In SIGMOD, 2002.
10. P. T. Wood. On the equivalence of xml patterns. In Computational Logic, 2000.
11. P. T. Wood. Minimising simple XPath expressions. In WebDB, 2001.
12. P. T. Wood. Containment for XPath fragments under DTD constraints. In ICDT, 2003.
13. W. Xu and Z. M. Özsoyoglu. Rewriting XPath queries using materialized views. In VLDB, 2005.