Complexity of Answering Unions of Conjunctive Queries
Investigate the inherent computational complexity associated with answering unions of conjunctive queries, a fundamental problem in database theory and logical query processing.
Systems & CSTheory & AlgosDatabase SystemsComputational Complexitydatabase theoryconjunctive queries
Theory-Fest 2019-2020: Fine-Grained Complexity
Source: Computational Complexity via YouTubeWatch on YouTube
Comments
Add a comment...Sign in