Containment between unions of xpath queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 405-420

  Zhou, Rui ^a   Liu, Chengfei ^a   Wang, Junhu ^b   Li, Jianxin ^a  

^a SWINBURNE UNIVERSITY OF TECHNOLOGY   (Australia)

^b GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; SCHEMA INFORMATION; XPATH QUERIES;

ALGORITHMS;

DATABASE SYSTEMS;

EID: 67650162757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_36     Document Type: Conference Paper

References (18)

1. Aho, A.V., Sagiv, Y., Ullman, J.D.: Equivalences among relational expressions. SIAM J. Comput. 8(2), 218-246 (1979)
2. Halevy, A.Y.: Answering queries using views: A survey. VLDB J. 10(4), 270-294 (2001) (Pubitemid 33570969)
3. Gupta, A., Sagiv, Y., Ullman, J.D., Widom, J.: Constraint checking with partial information. In: PODS, pp. 45-55 (1994)
4. Levy, A.Y., Sagiv, Y.: Queries independent of updates. In: VLDB, pp. 171-181 (1993)
5. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC, pp. 77-90 (1977)
6. Sagiv, Y., Yannakakis, M.: Equivalences among relational expressions with the union and di.erence operators. J. ACM 27(4), 633-655 (1980)
7. Clark, J., DeRose, S.: XML path language (XPath) 1.0. In: W3C Recommendation (November 1999), http://www.w3.org/TR/xpath
8. Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2-45 (2004)
9. Wood, P.T.: Containment for xPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 297-311. Springer, Heidelberg (2002)
10. Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, dTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 312-326. Springer, Heidelberg (2002)
11. Schwentick, T.: Xpath query containment. SIGMOD Rec. 33(1), 101-109 (2004) (Pubitemid 40290248)
12. Wadler, P.: A formal semantics of patterns in xslt and xpath. Markup Lang. 2(2), 183-202 (2000)
13. Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Tree pattern query minimization. The VLDB Journal 11(4), 315-331 (2002) (Pubitemid 36191786)
14. Wang, J., Yu, J.X., Liu, C.: On tree pattern query rewriting using views. In: Benatallah, B., Casati, F., Georgakopoulos, D., Bartolini, C., Sadiq, W., Godart, C. (eds.) WISE 2007. LNCS, vol. 4831, pp. 1-12. Springer, Heidelberg (2007)
15. Wang, J., Yu, J.X., Liu, C.: Contained rewritings of xPath queries using views revisited. In: Bailey, J., Maier, D., Schewe, K.-D., Thalheim, B., Wang, X.S. (eds.) WISE 2008. LNCS, vol. 5175, pp. 410-425. Springer, Heidelberg (2008)
16. Lakshmanan, L.V.S., Ramesh, G., Wang, H., Zhao, Z.: On testing satis.ability of tree pattern queries. In: VLDB, pp. 120-131 (2004)
17. Ioannidis, Y.E., Ramakrishnan, R.: Containment of conjunctive queries: beyond relations as sets. ACM Trans. Database Syst. 20(3), 288-324 (1995)
18. Ten Cate, B., Lutz, C.: The complexity of query containment in expressive fragments of xpath 2.0. In: PODS, pp. 73-82 (2007) (Pubitemid 47620882)