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)
68P15: Database theory
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