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.
Researcher
Self-contained public lectures, keynote addresses, and research seminars.
Investigate the inherent computational complexity associated with answering unions of conjunctive queries, a fundamental problem in database theory and logical query processing.