Pages that link to "Item:Q3452227"
From MaRDI portal
The following pages link to The complexity of query containment in expressive fragments of XPath 2.0 (Q3452227):
Displaying 11 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- Static analysis of navigational XPath over graph databases (Q269725) (← links)
- Least common container of tree pattern queries and its applications (Q715041) (← links)
- Complete axiomatizations for XPath fragments (Q975868) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- On the complexity of tree pattern containment with arithmetic comparisons (Q1944129) (← links)
- Axiomatizing the logical core of XPath 2.0 (Q2272223) (← links)
- Some modal aspects of XPath (Q2901192) (← links)
- On the minimization of XPath queries (Q3546357) (← links)
- Logical Foundations of XML and XQuery (Q3638998) (← links)
- Containment and equivalence for a fragment of XPath (Q5501184) (← links)