An Automata-Theoretic Approach to Regular XPath

Authors:
Diego Calvanese;Giuseppe Giacomo;Maurizio Lenzerini;Moshe Y. Vardi
Affiliations:
KRDB Research Centre, Free University of Bozen-Bolzano, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Italy;Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, Italy;Department of Computer Science, Rice University, Houston, U.S.A. 77251-1892
Venue:
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Year:
2009

Citing 21
Cited 8

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Alternating tree automata

Theoretical Computer Science
Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Small Progress Measures for Solving Parity Games

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Language containment of non-deterministic omega-automata

CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
The Hybrid µ-Calculus

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
View-Based Query Answering and Query Containment over Semistructured Data

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Reasoning on regular path queries

ACM SIGMOD Record
XPath query containment

ACM SIGMOD Record
DTDs versus XML schema: a practical study

Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Efficient algorithms for processing XPath queries

ACM Transactions on Database Systems (TODS)
Efficient static analysis of XML paths and types

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
XPath evaluation in linear time

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath, transitive closure logic, and nested tree walking automata

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Reasoning about XML with Temporal Logics and Automata

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
First order paths in ordered trees

ICDT'05 Proceedings of the 10th international conference on Database Theory
Observations on determinization of büchi automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

View update translation for XML

Proceedings of the 14th International Conference on Database Theory
Temporal logics for concurrent recursive programs: satisfiability and model checking

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
View-based query answering in Description Logics: Semantics and complexity

Journal of Computer and System Sciences
Query reasoning on trees with types, interleaving, and counting

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Efficient reasoning about data trees via integer linear programming

ACM Transactions on Database Systems (TODS)
Querying graph databases with XPath

Proceedings of the 16th International Conference on Database Theory
A trichotomy for regular simple path queries on graphs

Proceedings of the 32nd symposium on Principles of database systems
Model-Checking Parse Trees

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present Regular XPath (RXPath), which is a natural extension of XPath with regular expressions over paths that has the same computational properties as XPath: linear-time query evaluation and exponential-time reasoning. To establish these results, we devise a unifying automata-theoretic framework based on two-way weak alternating tree automata. Specifically, we consider automata that have infinite runs on finite trees. This enables us to leverage and simplify existing automata-theoretic machinery and develop algorithms both for query evaluation and for reasoning over queries. With respect to the latter problem, we consider RXPath as a constraint language, and study constraint satisfiability, and query satisfiability and containment under constraints in the setting of RXPath.