A more general theory of static approximations for conjunctive queries
From MaRDI portal
Publication:778535
DOI10.1007/S00224-019-09924-0zbMATH Open1446.68051OpenAlexW2944076341MaRDI QIDQ778535FDOQ778535
Authors: Pablo Barceló, Miguel Romero, Thomas Zeume 
Publication date: 2 July 2020
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8602/
Recommendations
- A more general theory of static approximations for conjunctive queries
- Efficient Approximations of Conjunctive Queries
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 1951561
- The complexity of acyclic conjunctive queries
- Complexity of Default Logic on Generalized Conjunctive Queries
- Optimization of a subclass of conjunctive queries
- scientific article; zbMATH DE number 219223
- scientific article; zbMATH DE number 3974350
- Semantic acyclicity for conjunctive queries: approximations and constraints
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conjunctive-query containment and constraint satisfaction
- Taming the infinite chase: query answering under expressive relational constraints
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Constraint solving via fractional edge covers
- A normal form for relational databases that is based on domains and keys
- Title not available (Why is that?)
- Querying the Guarded Fragment
- Data exchange: semantics and query answering
- The core of a graph
- Hypertree decompositions and tractable queries
- Conjunctive query containment revisited
- On the complexity of database queries
- Complexity of tree homomorphisms
- Semantic Acyclicity on Graph Databases
- Undecidable optimization problems for database logic programs
- Computer Science Logic
- On the expressive power of Datalog: tools and a case study.
- Efficient Approximations of Conjunctive Queries
- Decidability results for the boundedness problem
- Title not available (Why is that?)
- The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
Cited In (3)
This page was built for publication: A more general theory of static approximations for conjunctive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778535)
