YoVDO

Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees - I

Offered By: Simons Institute via YouTube

Tags

Fine-Grained Complexity Courses Computer Science Courses Logic Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a comprehensive lecture on accessing answers to unions of conjunctive queries with ideal time guarantees. Delve into the intricacies of fine-grained complexity, logic, and query evaluation as presented by Nofar Carmeli from Inria Montpellier. Learn about advanced techniques and theoretical concepts in database query processing, focusing on optimizing response times for complex query structures. Gain insights into the challenges and solutions in handling unions of conjunctive queries, a fundamental aspect of database management and information retrieval systems. This in-depth talk, part of the Simons Institute series, offers valuable knowledge for researchers, database administrators, and computer scientists interested in query optimization and computational complexity.

Syllabus

Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: I


Taught by

Simons Institute

Related Courses

Probabilistic Graphical Models 1: Representation
Stanford University via Coursera
Computer Security
Stanford University via Coursera
Intro to Computer Science
University of Virginia via Udacity
Introduction to Logic
Stanford University via Coursera
Internet History, Technology, and Security
University of Michigan via Coursera