Deciding XPath containment with MSO

Data and Knowledge Engineering

Volumn 63, Issue 1, 2007, Pages 108-136

  Genevès, Pierre ^a   Layaïda, Nabil ^a  

^a INRIA RHÔNE ALPES   (France)

Author keywords

Architectures of database systems; Construction of data knowledge bases; Containment; Query; Tools; XML; XPath

Indexed keywords

FORMAL LOGIC; OPTIMIZATION; PROBLEM SOLVING; QUERY PROCESSING; TREES (MATHEMATICS); XML;

DECISION PROCEDURES; KNOWLEDGE BASES; TREE AUTOMATA;

QUERY LANGUAGES;

EID: 34250162486     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2006.11.003     Document Type: Article

References (44)

1. Afanasiev L., Blackburn P., Dimitriou I., Gaiffe B., Goris E., Marx M., and de Rijke M. PDL for ordered trees. Journal of Applied Non-Classical Logics 15 2 (2005) 115-135
2. Amer-Yahia S., Cho S., Lakshmanan L.V.S., and Srivastava D. Minimization of tree pattern queries. SIGMOD Record 30 2 (2001) 497-508
3. Barceló P., and Libkin L. Temporal logics over unranked trees. LICS'05: Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (2005), IEEE Computer Society, New York, NY, USA 31-40
4. Benedikt M., Fan W., and Geerts F. XPath satisfiability in the presence of DTDs. PODS'05: Proceedings of the Twenty-fourth ACM Symposium on Principles of Database Systems (2005), ACM Press, New York, NY, USA 25-36
5. Benedikt M., Fan W., and Kuper G.M. Structural properties of XPath fragments. Theoretical Computer Science 336 1 (2005) 3-31
6. Benedikt M., and Segoufin L. Regular tree languages definable in FO. STACS'05: Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science. LNCS vol. 3404 (2005), Springer-Verlag, London, UK 327-339
7. A. Berglund, S. Boag, D. Chamberlin, M.F. Fernández, M. Kay, J. Robie, J. Siméon, XML path language (XPath) 2.0, W3C working draft, 2005. .
8. Biehl M., Klarlund N., and Rauhe T. Algorithms for guided tree automata. WIA'96: Revised Papers from the First International Workshop on Implementing Automata. LNCS vol. 1260 (1997), Springer-Verlag, London, UK 6-25
9. Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35 8 (1986) 677-691
10. Büchi J. Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6 (1960) 66-92
11. J. Clark, S. DeRose, XML path language (XPath) version 1.0, W3C recommendation, 1999. .
12. Clarke E.M., and Emerson E.A. Design and synthesis of synchronization skeletons using branching-time temporal logic. Logic of Programs, Workshop. LNCS vol. 131 (1981), Springer-Verlag, London, UK 52-71
13. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree automata techniques and applications. Available from: , release October, 1st 2002, 1997.
14. A. Deutsch, V. Tannen, Containment of regular path expressions under integrity constraints, in: KRDB'01: Proceedings of the 8th International Workshop on Knowledge Representation meets Databases. Vol. 45 of CEUR Workshop Proceedings. CEUR, , 2001, pp. 1-11.
15. Doner J. Tree acceptors and some of their applications. Journal of Computer and System Sciences 4 (1970) 406-451
16. D. Draper, P. Fankhauser, M. Fernández, A. Malhotra, K. Rose, M. Rys, J. Siméon, P. Wadler, XQuery 1.0 and XPath 2.0 formal semantics, W3C working draft. , 2005.
17. Elgaard J., Møller A., and Schwartzbach M.I. Compile-time debugging of C programs working on trees. ESOP'00: Proceedings of the 9th European Symposium on Programming Languages and Systems. LNCS vol. 1782 (2000), Springer-Verlag, London, UK 119-134
18. Elgot C. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society 98 (1961) 21-52
19. Fan W., Chan C.-Y., and Garofalakis M. Secure XML querying with security views. SIGMOD'04: Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data (2004), ACM Press, New York, NY, USA 587-598
20. Fischer M.J., and Ladner R.E. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences 18 2 (1979) 194-211
21. Franceschet M. XPathMark - an XPath benchmark for XMark generated data. XSYM'05: Proceedings of The Third International Symposium on Database and XML Technologies. LNCS vol. 3671 (2005), Springer-Verlag, London, UK 129-143
22. P. Genevés, J.-Y. Vion-Dury, XPath formal semantics and beyond: a Coq-based approach, in: TPHOLs'04: Emerging Trends Proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics, University of Utah, Salt Lake City, Utah, United States, 2004, pp. 181-198.
23. Grzegorczyk A. Some classes of recursive functions. Rozprawy Matematyczne 4 (1953) 1-45
24. Hosoya H., Vouillon J., and Pierce B.C. Regular expression types for xml. ACM Transactions on Programming Languages and Systems 27 1 (2005) 46-90
25. G. Huet, G. Kahn, C. Paulin-Mohring, The Coq Proof Assistant - A tutorial - Version 8.0. INRIA, 2004. URL: .
26. Klarlund N. Mona & Fido: the logic-automaton connection in practice. CSL'97: Selected Papers from the 11th International Workshop on Computer Science Logic. LNCS vol. 1414 (1998), Springer-Verlag, London, UK 311-326
27. N. Klarlund, A. Møller, MONA Version 1.4 User Manual, BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus, 2001.
28. Klarlund N., Møller A., and Schwartzbach M.I. MONA implementation secrets. CIAA'00: Revised Papers from the 5th International Conference on Implementation and Application of Automata. LNCS vol. 2088 (2001), Springer-Verlag, London, UK 182-194
29. Marx M. Conditional XPath, the first order complete XPath dialect. PODS'04: Proceedings of the Twenty-third ACM Symposium on Principles of Database Systems (2004), ACM Press, New York, NY, USA 13-22
30. Marx M. XPath with conditional axis relations. Proceedings of the 9th International Conference on Extending Database Technology. LNCS vol. 2992 (2004), Springer-Verlag, London, UK 477-494
31. Meyer A. Weak monadic second-order theory of successor is not elementary-recursive. In: Parikh R. (Ed). Proceedings of Logic Colloquium. Lecture Notes in Mathematics vol. 453 (1975), Springer-Verlag, New York, NY, USA 132-154
32. Miklau G., and Suciu D. Containment and equivalence for a fragment of XPath. Journal of the ACM 51 1 (2004) 2-45
33. Neven F. Automata theory for XML researchers. SIGMOD Record 31 3 (2002) 39-46
34. Neven F., and Schwentick T. XPath containment in the presence of disjunction, DTDs, and variables. ICDT'03: Proceedings of the 9th International Conference on Database Theory. LNCS vol. 2572 (2003), Springer-Verlag, London, UK 315-329
35. Schwentick T. XPath query containment. SIGMOD Record 33 1 (2004) 101-109
36. L. Stockmeyer, The complexity of decision problems in automata theory and logic, Tech. Rep. MAC-TR-133, Project MAC, M.I.T, Cambridge, MA, United States, 1974.
37. Stockmeyer L., and Meyer A. Word problems requiring exponential time. STOC'73: Proceedings of the 5th ACM symposium on Theory of computing (1973), ACM Press, New York, NY, USA 1-9
38. Sur G., Hammer J., and Siméon J. Updatex - an XQuery-based language for processing updates in XML. PLAN-X 2004: Proceedings of the International Workshop on Programming Language Technologies for XML, Venice, Italy. BRICS Notes Series vol. NS-03-4 (2004), BRICS, Aarhus, Denmark 40-53
39. Tanabe Y., Takahashi K., Yamamoto M., Tozawa A., and Hagiya M. A decision procedure for the alternation-free two-way modal μ-calculus. TABLEAUX'05: Proceedings of the 14th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. LNCS vol. 3702 (2005), Springer-Verlag, London, UK 277-291
40. Thatcher J.W., and Wright J.B. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2 1 (1968) 57-81
41. Tozawa A. Towards static type checking for XSLT. DocEng'01: Proceedings of the 2001 ACM Symposium on Document Engineering (2001), ACM Press, New York, NY, USA 18-27
42. P. Wadler, Two semantics for XPath, internal Technical Note of the W3C XSL Working Group, 2000. .
43. Wood P.T. On the equivalence of XML patterns. CL'00: Proceedings of the First International Conference on Computational Logic. LNCS vol. 1861 (2000), Springer-Verlag, London, UK 1152-1166
44. Wood P.T. Containment for XPath fragments under DTD constraints. ICDT'03: Proceedings of the 9th International Conference on Database Theory. LNCS vol. 2572 (2003), Springer-Verlag, London, UK 300-314