ABSTRACT
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operator, allowing one to restrict attention to a specific subtree while evaluating a subexpression. We show that the expressive power of this XPath dialect equals that of FO(MTC), first order logic extended with monadic transitive closure. We also give a characterization in terms of nested tree-walking automata. Using the latter we then proceed to show that the language is strictly less expressive than MSO. This solves an open question about the relative expressive power of FO(MTC) and MSO on trees. We also investigate the complexity for our XPath dialect. We show that query evaluation be done in polynomial time (combined complexity), but that satisfiability and query containment (as well as emptiness for our automaton model) are 2ExpTime-complete (it is ExpTime-complete for Core XPath).
- R. Alur, M. Arenas, P. Barceló, K. Etessami, N. Immerman, and L. Libkin. First-order and temporal logics for nested words. In LICS, pages 151--160, 2007. Google Scholar
Digital Library
- M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. In PODS, pages 25--36, 2005. Google Scholar
Digital Library
- M. Benedikt, W. Fan, and G. M. Kuper. Structural properties of XPath fragments. Theoretical Computer Science, 336(1):3--31, 2005. Google Scholar
Digital Library
- M. Benedikt and I. Fundulaki. XML subtree queries: Specification and composition. In DBPL, number 3774 in LNCS, pages 138--153, 2005. Google Scholar
Digital Library
- S. Bird, Y. Chen, S. B. Davidson, H. Lee, and Y. Zheng. Extending XPath to support linguistic queries. In PLAN-X, pages 35--46, 2005.Google Scholar
- M. Bojańczyk, M. Samuelides, T. Schwentick, and L. Segoufin. Expressive power of pebble automata. In ICALP (1), pages 157--168, 2006. Google Scholar
Digital Library
- J. Engelfriet and H. J. Hoogeboom. Nested pebbles and transitive closure. Logical Methods in Computer Science, 3(2), 2007.Google Scholar
- J. Engelfriet, H. J. Hoogeboom, and B. Samwel. XML transformation by tree-walking transducers with invisible pebbles. In L. Libkin, editor, PODS, pages 63--72. ACM Press, 2007. Google Scholar
Digital Library
- W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Rewriting regular xpath queries on XML views. In ICDE, pages 666--675, 2007.Google Scholar
Cross Ref
- G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In VLDB, pages 95--106, 2002. Google Scholar
Digital Library
- E. Grädel. On transitive closure logic. In E. Börger, G. Jäger, H. K. Büning, and M. M. Richter, editors, CSL, volume 626 of LNCS, pages 149--163. Springer, 1991. Google Scholar
Digital Library
- F. Laroussinie, N. Markey, and P. Schnoebelen. Temporal logic with forgettable past. In LICS, pages 383--392, 2002. Google Scholar
Digital Library
- M. Marx. Conditional XPath. Transactions on Database Systems, 30(4):929--959, 2005. Google Scholar
Digital Library
- M. Marx and M. de Rijke. Semantic characterizations of navigational XPath. SIGMOD Record, 34(2):41--46, 2005. Google Scholar
Digital Library
- C. Nentwich, L. Capra, W. Emmerich, and A. Finkelstein. xlinkit: a consistency checking and smart link generation service. ACM Transactions on Internet Technology, 2(2):151--185, 2002. Google Scholar
Digital Library
- F. Neven and T. Schwentick. On the power of tree-walking automata. Inf. Comput., 183(1):86--103, 2003. Google Scholar
Digital Library
- A. Potthoff. Logische Klassifizierung regularer Baumsprachen. PhD thesis, Christian-Albrechts Universität Kiel, 1994.Google Scholar
- B. ten Cate. The expressivity of XPath with transitive closure. In PODS, pages 328--337, 2006. Google Scholar
Digital Library
- B. ten Cate and C. Lutz. The complexity of query containment in expressive fragments of xpath 2.0. In PODS, pages 73--82. ACM, 2007. Google Scholar
Digital Library
- B. ten Cate and M. Marx. Axiomatizing the logical core of XPath 2.0. In ICDT, 2007. Google Scholar
Digital Library
Index Terms
XPath, transitive closure logic, and nested tree walking automata
Recommendations
Transitive closure logic, nested tree walking automata, and XPath
We study FO(MTC), first-order logic with monadic transitive closure, a logical formalism in between FO and MSO on trees. We characterize the expressive power of FO(MTC) in terms of nested tree-walking automata. Using the latter, we show that FO(MTC) is ...
The expressivity of XPath with transitive closure
PODS '06: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsWe extend Core XPath, the navigational fragment of XPath 1.0, with transitive closure and path equalities. The resulting language, Regular XPATH≈, is expressively complete for FO* (first-order logic extended with a transitive closure operator that can ...
Decidability of Downward XPath
We investigate the satisfiability problem for downward-XPath, the fragment of XPath that includes the child and descendant axes, and tests for (in)equality of attributes’ values. We prove that this problem is decidable, EXPTIME-complete. These bounds ...






Comments