Pages that link to "Item:Q5501184"

The following pages link to Containment and equivalence for a fragment of XPath (Q5501184):

Displaying 35 items.

• Deciding twig-definability of node selecting tree automata (Q269327) (← links)
• Static analysis of navigational XPath over graph databases (Q269725) (← links)
• Rewriting XPath queries using materialized XPath views (Q439966) (← links)
• Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons (Q506166) (← links)
• Conjunctive query containment over trees (Q532363) (← links)
• Computational complexity of the problem of tree generation under fine-grained access control policies (Q553325) (← links)
• Structural properties of XPath fragments (Q555765) (← links)
• XML queries and constraints, containment and reformulation (Q555769) (← links)
• Least common container of tree pattern queries and its applications (Q715041) (← links)
• Automata for XML -- a survey (Q878749) (← links)
• Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
• Weak containment for partial words is coNP-complete (Q894455) (← links)
• Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
• Schemas for unordered XML on a DIME (Q905687) (← links)
• Reasoning about XML update constraints (Q923878) (← links)
• Numerical constraints on XML data (Q964502) (← links)
• Complete axiomatizations for XPath fragments (Q975868) (← links)
• Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
• Tree size reduction with keeping distinguishability (Q1630987) (← links)
• Reasoning about integrity constraints for tree-structured data (Q1650919) (← links)
• Conjunctive query containment over trees using schema information (Q1702301) (← links)
• Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
• On the complexity of tree pattern containment with arithmetic comparisons (Q1944129) (← links)
• Learning algorithms (Q2074213) (← links)
• Reasoning about XML constraints based on XML-to-relational mappings (Q2322698) (← links)
• Model checking hybrid logics (with an application to semistructured data) (Q2506828) (← links)
• Satisfiability of Constraint Specifications on XML Documents (Q2945725) (← links)
• Efficiently Deciding μ-Calculus with Converse over Finite Trees (Q2957698) (← links)
• On the Complexity of Extracting Subtree with Keeping Distinguishability (Q2958316) (← links)
• Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
• A Rewrite Approach for Pattern Containment (Q3184735) (← links)
• XML Schema Mappings (Q3189647) (← links)
• The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates (Q3618616) (← links)
• On the Notion of an XML Key (Q5504580) (← links)
• Access-Condition-Table-Driven Access Control for XML Databases (Q5862305) (← links)