Conjunctive query containment over trees using schema information
From MaRDI portal
(Redirected from Publication:1702301)
Recommendations
Cites work
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 1953139 (Why is no real title available?)
- A variant of a recursively unsolvable problem
- Alternation
- Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
- Complexity of Data Tree Patterns over XML Documents
- Complexity of decision problems for XML schemas and chain regular expressions
- Conjunctive queries over trees
- Conjunctive query containment over trees
- Conjunctive-query containment and constraint satisfaction
- Containment and equivalence for a fragment of XPath
- Containment of monadic Datalog programs via bounded clique-width
- Database Programming Languages
- Deciding definability by deterministic regular expressions
- Deciding determinism of regular languages
- Domino-tiling games
- Generalizations of regular sets and their application to a study of context-free languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Minimization of tree patterns
- Monadic Datalog Containment
- On finding minimal length superstrings
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- On the complexity of typechecking top-down XML transformations
- One-unambiguous regular languages
- Query evaluation via tree-decompositions
- Relational and XML Data Exchange
- Solutions in XML data exchange
- The complexity of query containment in expressive fragments of XPath 2.0
- The shortest common supersequence problem over binary alphabet is NP- complete
- Two-variable logic on data trees and XML reasoning
- Validity of tree pattern queries with respect to schema information
- XML with incomplete information
- XPath satisfiability in the presence of DTDs
Cited in
(16)- Satisfiability for SCULPT-schemas for CSV-like data
- Conjunctive query evaluation by search-tree revisited
- Containment for conditional tree patterns
- Conjunctive query containment over trees
- scientific article; zbMATH DE number 2086293 (Why is no real title available?)
- Flexible Querying Using Criterion Trees: A Bipolar Approach
- Reasoning about integrity constraints for tree-structured data
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Reasoning about integrity constraints for tree-structured data
- Static analysis and query answering for incomplete data trees with constraints
- Testing satisfiability of a class of object-oriented conjunctive queries
- A revised result on chasing tree patterns under schema graphs
- XML queries and constraints, containment and reformulation
- 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?
This page was built for publication: Conjunctive query containment over trees using schema information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702301)
