The complexity of query containment in expressive fragments of XPath 2.0

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 73-82

  Ten Cate, Balder ^a   Lutz, Carsten ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Complexity; Containment; Satisfiability; XML; XPath

Indexed keywords

CONTAINMENT; PATH COMPLEMENTATION; PATH EQUALITY; XPATH;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL OPERATORS; XML;

QUERY PROCESSING;

EID: 35448961223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265541     Document Type: Conference Paper

References (28)

1. M. Benedikt, W. Fan, and F. Geerts. XPath. satisfiability in the presence of DTDs. In Proc. of PODS 2005, pages 25-36. ACM Press, 2005.
2. M. Benedikt, W. Fan, and G. M. Kuper. Structural properties of XPath fragments. Theoretical Computer Science, 336(1):3-31, 2005.
3. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
4. A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. In Proc. of KRDB 2001, volume 45 of CEUR Workshop Series. 2001.
5. K. Etessami, M. Y. Vardi, and T. Wilke. First order logic with two variables and unary temporal logic. Information and computation, 179(2):279-295, 2002.
6. W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Rewriting regular XPath queries on XML views. In Proc. of ICDE 2007, 2007.
7. G. Gottlob and C. Koch. Monadic queries over tree-structured data. In Proc. of LICS 2002, pages .189-202. IEEE Computer Society, 2002.
8. G. Gottlob, C. Koch, R. Pichler, and L. Segoufin. The complexity of XPath query evaluation and XML typing. Journal of the ACM, 52(2):284-335, 2005.
9. G. Gottlob, C. Koch, and K. U. Schulz. Conjunctive queries over trees. In Proc. of PODS 2004, pages .189-200. ACM Press, 2004.
10. M. Grohe and N. Schweikardt. The succinctness of first-order logic on linear orders. Logical Methods in Computer Science, 1(1), 2005.
11. B. C. Hammerschmidt, M. Kempa, and V. Linnemann. On the intersection of XPath expressions. In Proc. of IDEAS 2005, 2005.
12. J. Hidders. Satisfiability of XPath expressions. In Proc. of DBPL, pages 21-36, 2003.
13. R. E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing, 6(3):467-480, 1977.
14. M. Lange and C. Lutz. 2-ExpTime lower bounds for propositional dynamic logics with intersection. Journal of Symbolic Logic, 70(5):1072-1086, 2005.
15. W. Martens, F. Neven, T. Schwentick, and G. Bex. Expressiveness and complexity of XML Schema. ACM Transactions on Database Systems 31(3):770-813, 2006.
16. M. Marx. XPath with conditional axis relations. In Proc. of EDBT 2004, volume 2992 of LNCS. Springer, 2004.
17. M. Marx. Conditional XPath. ACM Transactions on Database Systems, 30(4):929-959, 2005.
18. M. Marx and M. de Rijke. Semantic characterizations of navigational XPath. ACM SIGMOD Record, 34(2):41-46, 2005.
19. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. of PODS 2002, pages 65-76. ACM Press, 2002.
20. M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Transactions on Internet Technology 5(4):660-704, 2005.
21. 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:1-30, 2006.
22. D. Olteanu, H. Meuss, T. Furche, and F. Bry. XPath: Looking forward. In Proc. of XMLDM 2002, pages 109-127. Springer Verlag, 2002.
23. T. Schwentick. XPath query containment. ACM SIGMOD Record, 33(1):101-109, 2004.
24. L. J. Stockmeyer. The Complexity of Decision Problems in Automata Theory. PhD thesis, Department of Electrical Engineering, MIT, 1974.
25. B. ten Cate. The expressivity of XPath with transitive closure. In Proc. of PODS 2006, pages 328-337. ACM Press, 2006.
26. B. ten Cate and M. Marx. Axiomatizing the logical core of XPath 2.0. In Proc. of ICDT 2007, 2007.
27. M. Vardi. Reasoning about the past with two-way automata. In Proc. of ICALP 1998, volume 1443 of LNCS, pages 628-641. Springer, 1998.
28. P. T. Wood. Containment for XPath fragments under DTD constraints. In Proc. of ICDT 2003, pages 300-314, 2003.