research-article

Deciding twig-definability of node selecting tree automata

Authors:

Timos Antonopoulos,

Frank NevenAuthors Info & Claims

ICDT '12: Proceedings of the 15th International Conference on Database Theory

Pages 61 - 73

https://doi.org/10.1145/2274576.2274584

Published: 26 March 2012 Publication History

Abstract

Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is visited in a selecting state during an accepting run. We consider twig patterns as an abstraction of XPath. Since the queries definable by NSTAs form a strict superset of twig-definable queries, we study the complexity of the problem to decide whether the query by a given NSTA is twig-definable. In particular, we obtain that the latter problem is EXPTIME-complete. In addition, we show that it is also EXPTIME-complete to decide whether the query by a given NSTA is definable by a node selecting string automaton.

References

[1]

M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. J. ACM, 55(2), 2008.

Digital Library

[2]

M. Benedikt, W. Fan, and G. M. Kuper. Structural properties of XPath fragments. Theor. Comput. Sci., 336(1):3--31, 2005.

Digital Library

[3]

M. Benedikt and C. Koch. XPath leashed. ACM Comput. Surv., 41(1), 2008.

Digital Library

[4]

M. Benedikt and L. Segoufin. Regular tree languages definable in FO and in FO_mod. ACM Trans. Comput. mod Log., 11(1), 2009.

Digital Library

[5]

M. Bojańczyk. Tree-walking automata. In Int. Conf. on Language and Automata Theory and Applications (LATA), pages 1--2, 2008.

Digital Library

[6]

M. Bojańczyk, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. J. ACM, 56(3), 2009.

Digital Library

[7]

M. Bojańczyk and P. Parys. XPath evaluation in linear time. J. ACM, To appear.

Digital Library

[8]

M. Bojańczyk and L. Segoufin. Tree languages defined in first-order logic with one quantifier alternation. Logical Methods in Computer Science, 6(4), 2010.

[9]

M. Bojańczyk and I. Walukiewicz. Characterizing EF and EX tree logics. Theor. Comput. Sci., 358(2--3):255--272, 2006.

Digital Library

[10]

D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Node selection query languages for trees. In AAAI Conference on Artificial Intelligence (AAAI), 2010.

[11]

J. Carme, J. Niehren, and M. Tommasi. Querying unranked trees with stepwise tree automata. In International Conference on Rewriting Techniques and Applications (RTA), pages 105--118, 2004.

[12]

H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Löding, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. Available on http://tata.gforge.inria.fr/, 2007.

[13]

M. P. Consens and T. Milo. Algebras for querying text regions: Expressive power and optimization. J. Comput. Syst. Sci., 57(3):272--288, 1998.

Digital Library

[14]

M. Frick, M. Grohe, and C. Koch. Query evaluation on compressed trees (extended abstract). In IEEE Symposium on Logic in Computer Science (LICS), pages 188--, 2003.

Digital Library

[15]

W. Gelade, T. Idziaszek, W. Martens, and F. Neven. Simplifying XML Schema: single-type approximations of regular tree languages. In ACM Symposium on Principles of Database Systems (PODS), pages 251--260, 2010.

Digital Library

[16]

E. Goris and M. Marx. Looping caterpillars. In Annual IEEE Symposium on Logic in Computer Science (LICS), pages 51--60, 2005.

Digital Library

[17]

G. Gottlob and C. Koch. Monadic datalog and the expressive power of languages for web information extraction. J. ACM, 51(1):74--113, 2004.

Digital Library

[18]

G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Trans. Database Syst., 30(2):444--491, 2005.

Digital Library

[19]

G. Gottlob, C. Koch, R. Pichler, and L. Segoufin. The complexity of xpath query evaluation and XML typing. J. ACM, 52(2):284--335, 2005.

Digital Library

[20]

W. Martens, F. Neven, T. Schwentick, and G. J. Bex. Expressiveness and complexity of XML Schema. ACM Trans. Database Syst., 31(3):770--813, 2006.

Digital Library

[21]

M. Marx. Conditional XPath. ACM Trans. Database Syst., 30(4):929--959, 2005.

Digital Library

[22]

G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1):2--45, 2004.

Digital Library

[23]

F. Neven. Design and Analysis of Query Languages for Structured Documents. PhD thesis, Limburgs Universitair Centrum, 1999.

[24]

F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3):39--46, 2002.

Digital Library

[25]

F. Neven. Attribute grammars for unranked trees as a query language for structured documents. J. Comput. Syst. Sci., 70(2):221--257, 2005.

Digital Library

[26]

F. Neven and J. V. den Bussche. Expressiveness of structured document query languages based on attribute grammars. J. ACM, 49(1):56--100, 2002.

Digital Library

[27]

F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. In ACM Symposium on Principles of Database Systems (PODS), pages 145--156, 2000.

Digital Library

[28]

F. Neven and T. Schwentick. Query automata over finite trees. Theor. Comput. Sci., 275(1--2):633--674, 2002.

Digital Library

[29]

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(3), 2006.

[30]

T. Place and L. Segoufin. Deciding definability in FO₂(<) (or XPath) on trees. In Annual IEEE Symposium on Logic in Computer Science (LICS), pages 253--262, 2010.

Digital Library

[31]

T. Schwentick. XPath query containment. SIGMOD Record, 33(1):101--109, 2004.

Digital Library

[32]

H. Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput., 19(3):424--437, 1990.

Digital Library

[33]

B. ten Cate and C. Lutz. The complexity of query containment in expressive fragments of XPath 2.0. J. ACM, 56(6), 2009.

Digital Library

[34]

B. ten Cate and L. Segoufin. Transitive closure logic, nested tree walking automata, and XPath. J. ACM, 57(3), 2010.

Digital Library

[35]

W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 7. Springer, 1997.

Digital Library

Cited By

Antonopoulos THovland DMartens WNeven F(2018)Deciding Twig-definability of Node Selecting Tree AutomataTheory of Computing Systems10.1007/s00224-015-9623-757:4(967-1007)Online publication date: 26-Dec-2018
https://dl.acm.org/doi/10.1007/s00224-015-9623-7
Czerwiński WMartens Wvan Rooijen LZeitoun M(2015)A Note on Decidable Separability by Piecewise Testable LanguagesFundamentals of Computation Theory10.1007/978-3-319-22177-9_14(173-185)Online publication date: 4-Aug-2015
https://doi.org/10.1007/978-3-319-22177-9_14

Index Terms

Deciding twig-definability of node selecting tree automata

Recommendations

Deciding Twig-definability of Node Selecting Tree Automata

Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is visited in a selecting state during an accepting run. We consider twig patterns as an abstraction ...
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata

We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urbański on ...
Deciding Top-Down Determinism of Regular Tree Languages
Fundamentals of Computation Theory
Abstract
It is well known that for a regular tree language it is decidable whether or not it can be recognized by a deterministic top-down tree automaton (DTA). However, the computational complexity of this problem has not been studied. We show that for a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDT '12: Proceedings of the 15th International Conference on Database Theory

March 2012

329 pages

ISBN:9781450307918

DOI:10.1145/2274576

General Chair:
Alin Deutsch
University of California, San Diego

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

ICDT '12

ICDT '12: 15th International Conference on Database Theory

March 26 - 29, 2012

Berlin, Germany

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
88
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Antonopoulos THovland DMartens WNeven F(2018)Deciding Twig-definability of Node Selecting Tree AutomataTheory of Computing Systems10.1007/s00224-015-9623-757:4(967-1007)Online publication date: 26-Dec-2018
https://dl.acm.org/doi/10.1007/s00224-015-9623-7
Czerwiński WMartens Wvan Rooijen LZeitoun M(2015)A Note on Decidable Separability by Piecewise Testable LanguagesFundamentals of Computation Theory10.1007/978-3-319-22177-9_14(173-185)Online publication date: 4-Aug-2015
https://doi.org/10.1007/978-3-319-22177-9_14

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents