On the minimization of Xpath queries

Proceedings - 29th International Conference on Very Large Data Bases, VLDB 2003

Volumn , Issue , 2003, Pages 153-164

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

^a UNIVERSITY OF CALABRIA   (Italy)

^b ICAR CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; XML;

OPTIMIZATION TECHNIQUES; POLYNOMIAL-TIME; RESEARCH COMMUNITIES; XML QUERIES; XML TREES; XPATH EXPRESSIONS; XPATH QUERIES;

OPTIMIZATION;

EID: 85012188484     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-012722442-8/50022-7     Document Type: Conference Paper

References (17)

1. S. Amer-Yahia, S. Cho, L. K. S. Lakshmanan, D. Srivastava, Minimization of tree pattern queries, Proc. of the 2001 ACM SIGMOD Conf. on Management of Data, Santa Barbara, California, USA, May 21-24, 2001.
2. D. Calvanese, G. De Giacomo, M. Lenzerini, M. Y. Vardi, Containment of Conjunctive Regular Path Queries with Inverse, Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR), Breckenridge, Colorado, USA, April 11-15, 2000.
3. A. K. Chandra, P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, Proc. of ACM Symp. on Theory of Computing (STOC), Boulder, Colorado, USA, May 2-4, 1977.
4. J. Clark, XML path language (XPath), http://www.w3.org/TR/xpath.
5. A. Deutsch, V. Tannen, Containment and Integrity constraints for Xpath fragments, Proc. of the 8th Int. Work. on Knowledge Representation meets Databases (KRDB), Rome, Italy, September 15, 2001.
6. A. Deutsch, V. Tannen, Reformulation of XML Queries and Constraints, Proc. of the 9th Int. Conf on Database Theory (ICDT), Siena, Italy, January 8-10, 2003.
7. D. Florescu, A. Levy, D. Suciu, Query containment for disjunctive queries with regular expressions, Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Seattle, Washington, June 1-3, 1998.
8. G. Gottlob, C. Koch, R. Pichler, Efficient algorithms for processing XPath queries, Proc. of the 28th International Conference on Very Large Data Bases (VLDB) Hong Kong, China August 20-23, 2002.
9. P. G. Kolaitis, M. Vardi, Conjunctive-query containment and constraint satisfaction, Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Seattle, Washington, USA, June 1-3, 1998.
10. P. G. Kolaitis, D. L. Martin, M. N. Thakur, On the complexity of the containment problem for conjunctive queries with built-in predicates, Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Seattle, Washington, USA, June 1-3, 1998.
11. A. Y. Levy, D. Suciu, Deciding containment for queries with complex objects, Proc. of the 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), May 12-14, 1997, Tucson, Arizona.
12. G. Miklau, D. Suciu, Containment and Equivalence for an XPath Fragment, Proc. of the 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS), Madison, Wisconsin, USA, June 3-5, 2002.
13. F. Neven, T. Schwentick, XPath Containment in the Presence of Disjunction, DTDs, and Variables, Proc. of the 9th Int. Conf on Database Theory (ICDT), Siena, Italy, January 8-10, 2003.
14. P. Ramanan, Efficient algorithms for minimizing tree pattern queries, Proc. of the 2002 ACM SIG-MOD Int. Conf. on Management of Data, Madison, Wisconsin, June 3-6, 2002.
15. P. T. Wood, On the equivalence of XML patterns, Proc. of the 1st Int. Conf. on Computational Logic (CL), London, UK, July 24-28, 2000.
16. P. T. Wood, Minimizing simple xpath expressions, Proc. of the 4th Int. Workshop on the Web and Databases (WebDB), Santa Barbara, California, USA, May 21-24, 2001.
17. P. T. Wood, Containment for XPath Fragments under DTD Constraints, Proc. of the 9th Int. Conf. on Database Theory (ICDT), Siena, Italy, January 8-10, 2003.