Containment and equivalence for a fragment of XPath
From MaRDI portal
Publication:5501184
DOI10.1145/962446.962448zbMath1316.68047OpenAlexW2033176822MaRDI QIDQ5501184
Publication date: 1 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/962446.962448
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information storage and retrieval of data (68P20)
Related Items (33)
Deciding twig-definability of node selecting tree automata ⋮ Tree size reduction with keeping distinguishability ⋮ A Rewrite Approach for Pattern Containment ⋮ Reasoning about integrity constraints for tree-structured data ⋮ XML Schema Mappings ⋮ Automata for XML -- a survey ⋮ Frontiers of tractability for typechecking simple XML transformations ⋮ Satisfiability of Constraint Specifications on XML Documents ⋮ Weak containment for partial words is coNP-complete ⋮ Structural characterizations of the navigational expressiveness of relation algebras on a tree ⋮ Efficiently Deciding μ-Calculus with Converse over Finite Trees ⋮ On the Complexity of Extracting Subtree with Keeping Distinguishability ⋮ On the complexity of tree pattern containment with arithmetic comparisons ⋮ Schemas for unordered XML on a DIME ⋮ Conjunctive query containment over trees using schema information ⋮ Rewriting XPath queries using materialized XPath views ⋮ Reasoning about XML update constraints ⋮ Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons ⋮ Applying model-checking to solve queries on semistructured data ⋮ Conjunctive query containment over trees ⋮ Numerical constraints on XML data ⋮ Computational complexity of the problem of tree generation under fine-grained access control policies ⋮ Structural properties of XPath fragments ⋮ XML queries and constraints, containment and reformulation ⋮ Least common container of tree pattern queries and its applications ⋮ Model checking hybrid logics (with an application to semistructured data) ⋮ The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates ⋮ Tractable Reasoning in a Fragment of Separation Logic ⋮ Deciding equivalence of top-down XML transformations in polynomial time ⋮ Learning algorithms ⋮ Reasoning about XML constraints based on XML-to-relational mappings ⋮ On the Notion of an XML Key ⋮ Access-Condition-Table-Driven Access Control for XML Databases
Uses Software
This page was built for publication: Containment and equivalence for a fragment of XPath
