N-ary queries by tree automata

Authors:
Joachim Niehren;Laurent Planque;Jean-Marc Talbot;Sophie Tison
Affiliations:
INRIA Futurs, LIFL, Lille, France;INRIA Futurs, LIFL, Lille, France;INRIA Futurs, LIFL, Lille, France;INRIA Futurs, LIFL, Lille, France
Venue:
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Year:
2005

Citing 16
Cited 10

On the finite degree of ambiguity of finite tree automata

Acta Informatica
Variable independence and aggregation closure

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A comparison of tree transductions defined by monadic second order logic and by attribute grammars

Journal of Computer and System Sciences
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Query automata over finite trees

Theoretical Computer Science
Monadic Queries over Tree-Structured Data

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Visual Web Information Extraction with Lixto

Proceedings of the 27th International Conference on Very Large Data Bases
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Variable independence for first-order definable constraints

ACM Transactions on Computational Logic (TOCL)
Regular expression pattern matching for XML

Journal of Functional Programming
Binary queries for document trees

Nordic Journal of Computing
The Lixto data extraction project: back and forth between theory and practice

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conditional XPath, the first order complete XPath dialect

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML type checking with macro tree transducers

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Patterns and types for querying XML documents

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Minimizing tree automata for unranked trees

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages

Interactive learning of node selecting tree transducer

Machine Learning
Reasoning about XML with Temporal Logics and Automata

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach

Fundamenta Informaticae
Linear delay enumeration and monadic second-order logic

Discrete Applied Mathematics
XPath whole query optimization

Proceedings of the VLDB Endowment
Queries on Xml streams with bounded delay and concurrency

Information and Computation
Combining temporal logics for querying XML documents

ICDT'07 Proceedings of the 11th international conference on Database Theory
Matching with regular constraints

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Learning n-ary node selecting tree transducers from completely annotated examples

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate n-ary node selection queries in trees by successful runs of tree automata. We show that run-based n-ary queries capture MSO, contribute algorithms for enumerating answers of n-ary queries, and study the complexity of the problem. We investigate the subclass of run-based n-ary queries by unambiguous tree automata.