Acta Informatica
Polynomial-time 1-Turing reductions from #PH to #P
Theoretical Computer Science
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Complexity of generalized satisfiability counting problems
Information and Computation
Closure properties of constraints
Journal of the ACM (JACM)
Theories of computability
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Scalable Techniques for Mining Causal Structures
Data Mining and Knowledge Discovery
Subtractive Reductions and Complete Problems for Counting Complexity Classes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue on PODS 2000
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Static analysis and optimization of semantic web queries
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
The complexity of weighted counting for acyclic conjunctive queries
Journal of Computer and System Sciences
Hi-index | 0.00 |
Conjunctive-query containment is considered as a fundamental problem in database query evaluation and optimization. Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a more detailed scope, where we investigate their counting problem by means of the algebraic approach through Galois theory, taking advantage of Post’s lattice. We prove a trichotomy theorem for the generalized conjunctive query counting problem, showing this way that, contrary to the corresponding decision problems, constraint satisfaction and conjunctive-query containment differ for other computational goals. We also study the audit problem for conjunctive queries asking whether there exists a frozen variable in a given query. This problem is important in databases supporting statistical queries. We derive a dichotomy theorem for this audit problem that sheds more light on audit applicability within database systems.