Journal of the ACM (JACM)
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automated Software Engineering
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
First-order logic with two variables and unary temporal logic
Information and Computation - Special issue: LICS'97
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
ACM SIGMOD Record
Testing Intersection of XPath Expressions under DTDs
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
The Succinctness of First-Order Logic on Linear Orders
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Semantic characterizations of navigational XPath
ACM SIGMOD Record
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
XML Queries and constraints, containment and reformulation
Theoretical Computer Science - Database theory
On the Intersection of XPath Expressions
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Regular expressions: new results and open problems
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Conjunctive queries over trees
Journal of the ACM (JACM)
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Answering xpath queries over networks by sending minimal views
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Axiomatizing the logical core of XPath 2.0
ICDT'07 Proceedings of the 11th international conference on Database Theory
Satisfiability of XPath queries with sibling axes
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
ACM Transactions on Database Systems (TODS)
XML with incomplete information
Journal of the ACM (JACM)
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of tree pattern containment with arithmetic comparisons
Information Processing Letters
Detecting and resolving conflicts between adaptation aspects in multi-staged XML transformations
Proceedings of the 11th ACM symposium on Document engineering
High-performance complex event processing over XML streams
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
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
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Containment of regular path queries under description logic constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Optimising XML---RDF data integration: a formal approach to improve XSPARQL efficiency
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Containment and satisfiability problem for XPath with recursion
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Querying graph databases with XPath
Proceedings of the 16th International Conference on Database Theory
SVMAX: a system for secure and valid manipulation of XML data
Proceedings of the 17th International Database Engineering & Applications Symposium
High-performance complex event processing over hierarchical data
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |
XPath is a prominent W3C standard for navigating XML documents that has stimulated a lot of research into query answering and static analysis. In particular, query containment has been studied extensively for fragments of the 1.0 version of this standard, whereas little is known about query containment in (fragments of) the richer language XPath 2.0. In this article, we consider extensions of CoreXPath, the navigational core of XPath 1.0, with operators that are part of or inspired by XPath 2.0: path intersection, path equality, path complementation, for-loops, and transitive closure. For each combination of these operators, we determine the complexity of query containment, both with and without DTDs. It turns out to range from ExpTime (for extensions with path equality) and 2-ExpTime (for extensions with path intersection) to non-elementary (for extensions with path complementation or for-loops). In almost all cases, adding transitive closure on top has no further impact on the complexity. We also investigate the effect of dropping the upward and/or sibling axes, and show that this sometimes leads to a reduction in complexity. Since the languages we study include negation and conjunction in filters, our complexity results can equivalently be stated in terms of satisfiability. We also analyze the above languages in terms of succinctness.