Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal Logics over Unranked Trees
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
An Automata-Theoretic Approach to Regular XPath
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Linear inclusion for XML regular expression types
Proceedings of the 18th ACM conference on Information and knowledge management
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
| Hi-index | 0.00 |
A major challenge of query language design is the combination of expressivity with effective static analyses such as query containment. In the setting of XML, documents are seen as finite trees, whose structure may additionally be constrained by type constraints such as those described by an XML schema. We consider the problem of query containment in the presence of type constraints for a class of regular path queries extended with counting and interleaving operators. The counting operator restricts the number of occurrences of children nodes satisfying a given logical property. The interleaving operator provides a succinct notation for describing the absence of order between nodes satisfying a logical property. We provide a logic-based framework supporting these operators, which can be used to solve common query reasoning problems such as satisfiability and containment of queries in exponential time.