Automata for XML---A survey

Authors:
Thomas Schwentick
Affiliations:
University of Dortmund, Department of Computer Science, 44221 Dortmund, Germany
Venue:
Journal of Computer and System Sciences
Year:
2007

Citing 77
Cited 40

Deciding equivalence of finite tree automata

SIAM Journal on Computing
On two-way tree automata

Information Processing Letters
Finite-memory automata

Theoretical Computer Science
Minimal Ascending and Descending Tree Automata

SIAM Journal on Computing
Languages, automata, and logic

Handbook of formal languages, vol. 3
One-unambiguous regular languages

Information and Computation
Trips on trees

Acta Cybernetica
SGML & XML content models

Markup Languages
DTD inference for views of XML data

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Extended path expressions of XML

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for web information extraction

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the power of walking for querying tree-structured data

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Syntax-Directed Semantics: Formal Models Based on Tree Transducers

Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Query automata over finite trees

Theoretical Computer Science
Automata theory for XML researchers

ACM SIGMOD Record
A formal model for an expressive fragment of XSLT

Information Systems - Databases: Creation, management and utilization
XPath processing in a nutshell

ACM SIGMOD Record
Containment for XPath Fragments under DTD Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Typechecking Top-Down Uniform Unranked Tree Transducers

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Processing XML Streams with Deterministic Automata

ICDT '03 Proceedings of the 9th International Conference on Database Theory
The Complexity of First-Order and Monadic Second-Order Logic Revisited

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Everything You Ever Wanted to Know About DTDs, But Were Afraid to Ask (Extended Abstract)

Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
The Complexity of Compositions of Deterministic Tree Transducers

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Automata, Logic, and XML

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Typechecking for Semistructured Data

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
XPath Containment in the Presence of Disjunction, DTDs, and Variables

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Typechecking XML views of relational databases

ACM Transactions on Computational Logic (TOCL)
View-based query containment

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Numerical document queries

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typing and querying XML documents: some complexity bounds

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath processing in a nutshell

ACM SIGMOD Record
A Web odyssey: from codd to XML

ACM SIGMOD Record
An algebraic approach to data languages and timed languages

Information and Computation
Using Regular Tree Automata as XML Schemas

ADL '00 Proceedings of the IEEE Advances in Digital Libraries 2000
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
On the power of tree-walking automata

Information and Computation - Special issue: ICC '99
Complete problems for deterministic polynomial time

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
XML with data values: typechecking revisited

Journal of Computer and System Sciences - Special issu on PODS 2001
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Reasoning on regular path queries

ACM SIGMOD Record
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
Regular expression pattern matching for XML

Journal of Functional Programming
XPath query containment

ACM SIGMOD Record
Efficient Incremental Validation of XML Documents

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Finite state machines for strings over infinite alphabets

ACM Transactions on Computational Logic (TOCL)
DTDs versus XML schema: a practical study

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
On validation of XML streams using finite state machines

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Checking potential validity of XML documents

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Incremental validation of XML documents

ACM Transactions on Database Systems (TODS)
Cache-Conscious Automata for XML Filtering

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Frontiers of tractability for typechecking simple XML transformations

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive queries over trees

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of XSDs: from practice to theory, there and back again

WWW '05 Proceedings of the 14th international conference on World Wide Web
Attribute grammars for unranked trees as a query language for structured documents

Journal of Computer and System Sciences
XML type checking with macro tree transducers

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Looping Caterpillars

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A transducer-based XML query processor

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient processing of expressive node-selecting queries on XML data in secondary storage: a tree automata-based approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Schema-based scheduling of event processors and buffer minimization for queries on structured data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Tree acceptors and some of their applications

Journal of Computer and System Sciences
XML schema, tree logic and sheaves automata

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Logic and automata: a match made in heaven

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Minimizing tree automata for unranked trees

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Logics for unranked trees: an overview

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Which XML schemas admit 1-pass preorder typing?

ICDT'05 Proceedings of the 10th international conference on Database Theory
First order paths in ordered trees

ICDT'05 Proceedings of the 10th international conference on Database Theory
Regular tree languages definable in FO

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

The complexity of reasoning about pattern-based XML schemas

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs

Language and Automata Theory and Applications
Tree Automata with Global Constraints

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
XPath leashed

ACM Computing Surveys (CSUR)
Rewriting of visibly pushdown languages for xml data integration

Proceedings of the 17th ACM conference on Information and knowledge management
Reasoning about XML with Temporal Logics and Automata

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Adding nesting structure to words

Journal of the ACM (JACM)
The finite model theory toolbox of a database theoretician

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Operational state complexity of nested word automata

Theoretical Computer Science
Semantics, Types and Effects for XML Updates

DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Efficient inclusion checking for deterministic tree automata and XML Schemas

Information and Computation
Schema-based independence analysis for XML updates

Proceedings of the VLDB Endowment
Weighted parsing of trees

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Weighted tree-walking automata

Acta Cybernetica
The HOM problem is decidable

Proceedings of the forty-second ACM symposium on Theory of computing
Rewrite-based verification of XML updates

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Database theory: query languages

Algorithms and theory of computation handbook
Automata vs. logics on data words

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On the satisfiability of two-variable logic over data words

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
View update translation for XML

Proceedings of the 14th International Conference on Database Theory
Complexity of Decision Problems for XML Schemas and Chain Regular Expressions

SIAM Journal on Computing
Evolving schemas for streaming XML

Theoretical Computer Science
State trade-offs in unranked tree automata

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
On the use of guards for logics with data

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Succinctness of the Complement and Intersection of Regular Expressions

ACM Transactions on Computational Logic (TOCL)
State complexity of the concatenation of regular tree languages

Theoretical Computer Science
Evolving schemas for streaming XML

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
State complexity of kleene-star operations on trees

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Foundations of XML based on logic and automata: a snapshot

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Regular expressions for data words

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Highly expressive query languages for unordered data trees

Proceedings of the 15th International Conference on Database Theory
Bounded repairability for regular tree languages

Proceedings of the 15th International Conference on Database Theory
Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Fundamenta Informaticae
State complexity of projection and quotient on unranked trees

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Lower bounds for the size of deterministic unranked tree automata

Theoretical Computer Science
The grammatical approach: A syntax-directed declarative specification method for XML processing tasks

Computer Standards & Interfaces
Similarity Measures for Substituting Web Services

International Journal of Web Services Research
XML compression via DAGs

Proceedings of the 16th International Conference on Database Theory
The HOM problem is decidable

Journal of the ACM (JACM)
XML tree structure compression using RePair

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automata play an important role for the theoretical foundations of XML data management, but also in tools for various XML processing tasks. This survey article aims to give an overview of fundamental properties of the different kinds of automata used in this area and to relate them to the four key aspects of XML processing: schemas, navigation, querying and transformation.