Tree pattern query minimization

VLDB Journal

Volumn 11, Issue 4, 2002, Pages 315-331

  Amer Yahia, Sihem ^a   Cho, SungRan ^b   Lakshmanan, Laks V S ^c   Srivastava, Divesh ^a  

^a AT AND T LABS RESEARCH   (United States)

^b STEVENS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Query minimization; Tree patterns; XML

Indexed keywords

ALGORITHMS; OPTIMIZATION; QUERY LANGUAGES; XML;

QUERY MINIMIZATION;

TREES (MATHEMATICS);

EID: 0036996151     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00778-002-0076-7     Document Type: Article

References (27)

1. S. Abiteboul (1989) Boundedness is undecidable for datalog programs with a single recursive rule. Inf Process Lett 32(6):281-287
2. S. Amer-Yahia, S. Cho, L.V.S. Lakshmanan, D. Srivastava (2001) Minimization of tree patterns queries. SIGMOD, pp. 497-508
3. S. Boag, D. Chamberlin, M.F. Fernandez, D. Florescu, J. Robie, J. Simeon, M. Stefanescu. XQuery 1.0: An XML query language. W3C Working Draft. Available at: http://www.w3.org/TR/xquery
4. D. Calvanese, G. De Giacomo, M. Lenzerini (1998) On the decidability of query containment under constraints. PODS, pp. 149-158
5. S. Chakravarthy, J. Grant, J. Minker (1988) Foundations of semantic query optimization for deductive databases. Foundations of DD and LP, pp. 243-273
6. D.D. Chamberlin, J. Robie, D. Florescu (2000) Quilt: An XML query language for heterogeneous data sources. WebDB, pp. 1-25
7. E.P.F. Chan (1992) Containment and minimization of positive conjunctive queries in OODBs. PODS, p. 202-211
8. A.K. Chandra, P.M. Merlin (1977) Optimal implementation of conjunctive queries in relational databases. STOC, pp. 77-90
9. V. Christophides, S. Cluet, J. Simeon (2000) On wrapping query languages and efficient XML integration. SIGMOD, pp. 141-152
10. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu (1999) A query language for XML. WWW8/Computer Networks 31 (11-16), pp. 1155-1169
11. A. Deutsch, V. Tannen (2001) Containment and integrity constraints for XPath fragments. KRDB
12. A. Deutsch, V. Tannen (2001) Optimization properties for classes of conjunctive regular path queries. DBPL
13. D. Florescu, A.Y. Levy, D. Suciu (1998) Query containment for conjunctive queries with regular expressions. PODS, pp. 139-148
14. T. Howes, M. Smith, G.S. Good (1999) Understanding and deploying LDAP directory services. Macmillan, Indianapolis, Ind., USA
15. H.V. Jagadish, L.V.S. Lakshmanan, T. Milo, D. Srivastava, D. Vista (1999) Querying network directories. SIGMOD, pp. 133-144
16. P.G. Kolaitis, D.L. Martin, M.N. Thakur (1998) On the complexity of the containment problem for conjunctive queries with built-in predicates. PODS, pp. 197-204
17. P.G. Kolaitis, M.Y. Vardi (1998) Conjunctive-query containment and constraint satisfaction. PODS, pp. 205-213
18. A.Y. Levy, D. Suciu (1997) Deciding containment for queries with complex objects. PODS, pp. 20-31
19. J. McHugh, J. Widom (1999) Query optimization for XML. VLDB, pp. 315-326
20. G. Miklau, D. Suciu (2002) Containment and equivalence for an XPath fragment. PODS, pp. 65-76
21. T.D. Millstein, A.Y. Levy, M. Friedman (2000) Query containment for data integration systems. PODS, pp. 67-75
22. L. Popa, A. Deutsch, A. Sahuguet, V. Tannen (2000) A chase too far? SIGMOD, pp. 273-284
23. L. Popa, V. Tannen (1999) An equational chase for path-conjunctive queries, constraints, and views. ICDT, pp. 39-57
24. Y.P. Saraiya (1990) Polynomial-time program transformations in deductive databases. PODS, pp. 132-144
25. J.D. Ullman (1989) Principles of database and knowledge-base systems, vols. 1 and 2. Computer Science, Rockville, Md., USA
26. P.T. Wood(2000) On the equivalence of XML patterns. DOOD, pp. 1152-1166
27. P.T. Wood (2001) Minimizing simple XPath expressions. WebDB, pp. 13-18