Optimizing Conjunctive Queries over Trees Using Schema Information
From MaRDI portal
Recommendations
Cited in
(16)- Eliminating recursion from monadic datalog programs on trees
- Conjunctive query evaluation by search-tree revisited
- On the complexity of tree pattern containment with arithmetic comparisons
- Conjunctive query containment over trees
- scientific article; zbMATH DE number 2086293 (Why is no real title available?)
- Containment of monadic Datalog programs via bounded clique-width
- Conjunctive query containment over trees using schema information
- Future-Looking Logics on Data Words and Trees
- Complexity of Data Tree Patterns over XML Documents
- Extending two-variable logic on data trees with order on data values and its automata
- XML schema mappings, data exchange and metadata management
- A revised result on chasing tree patterns under schema graphs
- Validity of tree pattern queries with respect to schema information
- Conjunctive queries over trees
- Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
- Solutions in XML data exchange
This page was built for publication: Optimizing Conjunctive Queries over Trees Using Schema Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599121)