Conjunctive query containment over trees (Q532363): Difference between revisions

@@ Property / cites work @@
+XML data exchange
@@ Property / cites work: XML data exchange / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing Conjunctive Queries over Trees Using Schema Information
+Normal rank
@@ Property / cites work @@
+Containment and Optimization of Object-Preserving Conjunctive Queries
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of XPath query evaluation and XML typing
+Normal rank
@@ Property / cites work @@
+Conjunctive queries over trees
@@ Property / cites work: Conjunctive queries over trees / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive-query containment and constraint satisfaction
+Normal rank
@@ Property / cites work @@
+Containment and equivalence for a fragment of XPath
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+On deciding well-definedness for query languages on trees
+Normal rank