Direct Access for Conjunctive Queries with Aggregation

Explore a 29-minute lecture on direct access for conjunctive queries with aggregation, presented by Nofar Carmeli from Inria Montpellier as part of the Logic and Algebra for Query Evaluation series. Delve into the simulation of lexicographically-sorted arrays of answers to conjunctive queries with grouping and aggregation, focusing on near-optimal time guarantees. Examine the classification of conjunctive queries with and without aggregation, and investigate the feasibility of including aggregation in lexicographic ordering. Learn about the tractable case of semirings with idempotent addition, such as min and max, and understand the algorithm's reliance on non-trivial annotations in a single relation. Gain insights from this talk, which is based on a paper to be presented at ICDT 2024.