Conjunctive query containment revisited
From MaRDI portal
Publication:1575132
DOI10.1016/S0304-3975(99)00220-0zbMath0944.68046MaRDI QIDQ1575132
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (37)
Parametrised Complexity of Satisfiability in Temporal Logic ⋮ Some complete and intermediate polynomials in algebraic complexity theory ⋮ Semantic Acyclicity on Graph Databases ⋮ It's all a matter of degree. Using degree information to optimize multiway joins ⋮ Rewriting queries using views in the presence of arithmetic comparisons ⋮ Conjunctive query evaluation by search-tree revisited ⋮ Answering conjunctive queries with inequalities ⋮ Regular queries on graph databases ⋮ Weighted hypertree decompositions and optimal query plans ⋮ Tractable counting of the answers to conjunctive queries ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Generic local computation ⋮ Rewriting with Acyclic Queries: Mind Your Head ⋮ Determinacy and query rewriting for conjunctive queries and views ⋮ Unnamed Item ⋮ Graph theory in Coq: minors, treewidth, and isomorphisms ⋮ Unnamed Item ⋮ A unified theory of structural tractability for constraint satisfaction problems ⋮ The price of query rewriting in ontology-based data access ⋮ Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons ⋮ Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues ⋮ Foundations of semantic web databases ⋮ On the power of structural decompositions of graph-based representations of constraint problems ⋮ On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay ⋮ Unnamed Item ⋮ On Generalization and Subsumption for Ordered Clauses ⋮ Unnamed Item ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Counting Answers to Existential Questions ⋮ Tree-Width for First Order Formulae ⋮ A more general theory of static approximations for conjunctive queries ⋮ A Logical Approach to Constraint Satisfaction ⋮ Uniform Constraint Satisfaction Problems and Database Theory ⋮ A comparison of structural CSP decomposition methods ⋮ Conjunctive-query containment and constraint satisfaction ⋮ Prediction-hardness of acyclic conjunctive queries ⋮ Large hypertree width for sparse random hypergraphs
Cites Work
- Unnamed Item
- Zero knowledge and the chromatic number
- Answering queries using limited external query processors
- Optimization of a subclass of conjunctive queries
- Optimizing Conjunctive Queries that Contain Untyped Variables
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Complexity of Finding Embeddings in a k-Tree
- Equivalences among Relational Expressions
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- A linear time algorithm for finding tree-decompositions of small treewidth
This page was built for publication: Conjunctive query containment revisited
