On the minimization of XPath queries

Journal of the ACM

Volumn 55, Issue 1, 2008, Pages

  Flesca, S ^a   Furfaro, F ^a   Masciari, E ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b ICAR CNR   (Italy)

Author keywords

Query containment; Query minimization; Tree pattern matching; XPath expressions

Indexed keywords

COMPUTATIONAL COMPLEXITY; PATTERN MATCHING; SYNTACTICS; XML;

QUERY CONTAINMENT; QUERY MINIMIZATION; TREE PATTERN MATCHING; XPATH EXPRESSIONS;

QUERY PROCESSING;

EID: 40549106750     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1326554.1326556     Document Type: Article

References (28)

1. ABITEBOUL, S. 1989. Boundedness is undecidable for datalog programs with a single recursive rule. Inf. Process. Lett. 32, 6, 281-287.
2. AMER-YAHIA, S., CHO, S., LAKSHMANAN, L. K. S., AND SRIVASTAVA, D. 2002. Tree pattern query minimization. VLDB J. 11, 4, 315-331.
3. BENEDIKT, M., FAN, W., AND KUPER, G. M. 2003. Structural properties of XPath fragments. In Proceedings of the 9th International Conference on Database Theory (ICDT), Siena, Italy. 79-95.
4. CHAN, C. Y., FAN, W., AND ZENG, Y. 2004. Taming XPath queries by minimizing wildcard steps. In Proceedings of the 30th International Conference on Very Large Data Bases (VLDB), Toronto, Ont., Canada. ACM, New York, 156-167.
5. CHANDRA, A. K., AND MERLIN, P. M. 1977. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the 9th ACM Symposium on Theory of Computing (STOC), (New York, NY). ACM, New York, 77-90.
6. CHEKURI, C., AND RAJARAMAN, A. 1997. Conjunctive query containment revisited. In Proceedings of the 6th International Conference on Database Theory (ICDT), Delphi, Greece. 56-70.
7. DEUTSCH, A., AND TANNEN, V. 2001. Containment and Integrity constraints for XPath fragments. In Proceedings of the 8th International Workshop on Knowledge Representation Meets Databases (KRDB), Rome, Italy.
8. GOTTLOB, G., KOCH, C., AND PICHLER, R. 2002. Efficient algorithms for processing XPath queries. In Proceedings of the 28th International Conference on Very Large Databases (VLDB), Hong Kong, China. ACM, New York, 95-106.
9. KIMELFELD, B., AND SAGIV, Y. 2008. Revisiting redundancy and minimization in an XPath fragment. In Proceedings of the 11th International Conference on Extending Database Technology (EDBT) (Nantes, France). To appear.
10. KOLAITIS, P. G., AND VARDI, M. 2000. Conjunctive-query containment and constraint satisfaction. J. Comput. Syst. Sci. 61, 302-332.
11. MIKLAU, G., AND SUCIU, D. 2004. Containment and Equivalence for an XPath Fragment. J. ACM 51, 1, 2-45.
12. MILO, T., AND SUCIU, D. 1999. Index structures for path expressions. In Proceedings of the 7th International Conference on Database Theory (ICDT) (Jerusalem, Israel). 277-295.
13. NEVEN, F., AND SCHWENTICK, T. 2003. XPath containment in the presence of disjunction, DTDs, and variables. In Proceedings of the 9th International Conference on Database Theory (ICDT) (Siena, Italy). 315-329.
14. RAMANAN, P. 2002. Efficient algorithms for minimizing tree pattern queries. In Proceedings of the of ACM SIGMOD Conference on Management of Data (SIGMOD) (Madison, WI). ACM, New York, 299-309.
15. SAGIV, Y., AND YANNAKAKIS, M. 1980. Equivalence between relational expressions with the union and difference operators. J. ACM 27, 4, 633-655.
16. SCHWENTICK, T. 2004. XPath query containment. ACM SIGMOD Record 33, 1, 101-109.
17. SHMUELI, O. 1993. Equivalence of datalog queries is undecidable. J. Logic Program. 15, 3, 231-241.
18. WOOD, P. T. 2000. On the equivalence of XML patterns. In Proceedings of the 1st International Conference on Computational Logic (CL) (London, UK), 1152-1166.
19. WOOD, P. T. 2001. Minimizing simple XPath expressions. In Proceedings of the 4th International Workshop on the Web and Databases (WebDB) (Santa Barbara, CA). 13-18.
20. WOOD, P. T. 2003. Containment for XPath fragments under DTD constraints. In Proceedings of the 9th International Conference on Database Theory (ICDT) (Siena, Italy), 300-314.
21. XLI. 2004. XML Linking Language (XLink) Version 1.0-W3C Recommendation. In http://www.w3.org/TR/2001/REC-xlink-20010627/.
22. XML. 2004. Extensible Markup Language (XML) 1.0 (Third Edition)-W3C Recommendation. In http://www.w3c.org/TR/2004/REC-xml-20040204/.
23. XPA. 1999. XML Path Language (XPath) Version 1.0-W3C Recommendation. In http://www.w3.org/TR/xpath.
24. XPO. 2002. XML Pointer Language (XPointer)-W3C Working Draft. In http://www.w3.org/TR/2002/WD-xptr-20020816/.
25. XQu. 2004. XQuery 1.0: An XML Query Language-W3C Working Draft. In http://www.w3.org/TR/xquery/.
26. XSC. 2001. XML Schema Part 0: Primer-W3C Recommendation. In http://www.w3.org/TR/xmlschema-0/.
27. XSLT. 1999. XSL Transformations (XSLT) Version 1.0-W3C Recommendation. In http://www.w3.org/TR/xslt.
28. YANNAKAKIS, M. 1981. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Databases (VLDB) (Cannes, France), ACM, New York, 82-94.