Efficient inclusion checking for deterministic tree automata and XML Schemas

Authors:
Jérôme Champavère;Rémi Gilleron;Aurélien Lemay;Joachim Niehren
Affiliations:
Inria Lille -- Nord Europe, Parc scientifique de la Haute Borne, 40 avenue Halley, Bât. A, Park Plaza, 59650 Villeneuve d'Ascq, France and Laboratoire d'Informatique Fondamentale de Lille, Un ...;Inria Lille -- Nord Europe, Parc scientifique de la Haute Borne, 40 avenue Halley, Bât. A, Park Plaza, 59650 Villeneuve d'Ascq, France and Laboratoire d'Informatique Fondamentale de Lille, Un ...;Inria Lille -- Nord Europe, Parc scientifique de la Haute Borne, 40 avenue Halley, Bât. A, Park Plaza, 59650 Villeneuve d'Ascq, France and Laboratoire d'Informatique Fondamentale de Lille, Un ...;Inria Lille -- Nord Europe, Parc scientifique de la Haute Borne, 40 avenue Halley, Bât. A, Park Plaza, 59650 Villeneuve d'Ascq, France
Venue:
Information and Computation
Year:
2009

Citing 24
Cited 7

LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation

Information Processing Letters
Deciding equivalence of finite tree automata

SIAM Journal on Computing
Regular expressions into finite automata

Theoretical Computer Science
Haskell overloading is DEXPTIME-complete

Information Processing Letters
One-unambiguous regular languages

Information and Computation
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Datalog LITE: a deductive query language with linear time model checking

ACM Transactions on Computational Logic (TOCL)
What You Always Wanted to Know About Datalog (And Never Dared to Ask)

IEEE Transactions on Knowledge and Data Engineering
Monadic Queries over Tree-Structured Data

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Typechecking for XML transformers

Journal of Computer and System Sciences - Special issue on PODS 2000
DTDs versus XML schema: a practical study

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
XML type checking with macro tree transducers

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML Schema

XML Schema
RELAX NG

RELAX NG
Taxonomy of XML schema languages using formal language theory

ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema

ACM Transactions on Database Systems (TODS)
Automata for XML---A survey

Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Marrying words and trees

Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Streaming tree automata

Information Processing Letters
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

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
Which XML schemas admit 1-pass preorder typing?

ICDT'05 Proceedings of the 10th international conference on Database Theory

Limitations of lower bound methods for deterministic nested word automata

Information and Computation
Queries on Xml streams with bounded delay and concurrency

Information and Computation
XEvolve: an XML schema evolution framework

Proceedings of the 2011 ACM Symposium on Applied Computing
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
Query induction with schema-guided pruning strategies

The Journal of Machine Learning Research
Almost-linear inclusion for XML regular expression types

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms for testing language inclusion L(A)@?L(B) between tree automata in time O(|A|.|B|) where B is deterministic (bottom-up or top-down). We extend our algorithms for testing inclusion of automata for unranked trees A in deterministic DTDs or deterministic EDTDs with restrained competition D in time O(|A|.|@S|.|D|). Previous algorithms were less efficient or less general.