All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-In
–
Opening Remarks
–
On the convergence rate of Datalogo programs over stable semirings
Hung Ngo (RelationalAI)
–
Applications of entropic inequalities to query evaluation
Dan Suciu (University of Washington)
–
Break
–
Hypergraph pattern detection using matrix multiplication: A general framework
Mahmoud Abo Khamis (Relational AI)
–
Zero-overhead Instance-optimal Join Algorithms
Remy Wang (UCLA)
–
Neuro-Symbolic Query Answering
Floris Geerts (University of Antwerp)
–
Lunch (on your own)
–
Instance optimality and SAT solvers
Antonina Kolokolova (Memorial University of Newfoundland)
–
Joinless evaluation of aggregate queries
Reinhard Pichler (Vienna University of Technology)
–
Break
–
A unified and practical approach to generalized deletion propagation
Wolfgang Gatterbauer (Northeastern University)
–
Reception
–
Coffee and Check-In
–
Consistency of Relations over Monoids
Phokion Kolaitis (UC Santa Cruz and IBM Research)
–
Break
–
What is New in Join-Aggregate Query Processing?
Xiao Hu (University of Waterloo)
–
Programming in the Large with Data
Wim Martens (University of Bayreuth)
–
Lunch (on your own)
–
Datalog Over Semirings: Efficient Evaluation and Provenance Circuits
Sudeepa Roy (Duke University)
–
Datalog Over Semirings: Efficient Evaluation and Provenance Circuits
Paris Koutris (UW-Madison)
–
Break
–
Partition Constraints for Conjunctive Queries: Bounds and Worst-Case Optimal Joins
Kyle Deeds (University of Washington)
–
Coffee and Check-In
–
Efficiency and Effectiveness of a Practical Provenance and Probabilistic DBMS
Pierre Senellart (ENS, PSL University)
–
Enumeration of Minimal Hitting Sets Parameterized by Treewidth
Batya Kenig (Technion)
–
Break
–
A Query Language for Explainability
Marcelo Arenas (PUC Chile and RelationalAI)
–
Talk by
Yoo Jung Choi (Arizona State University)
–
Talk by
Benjie Wang (University of California, Los Angeles)
–
Lunch (on your own)
–
Bit Blasting Continuous Random Variables
Guy Van den Broeck (UCLA)
–
Talk by
Conor Power (Berkeley)
–
Break
–
Incremental Computation: What Is the Essence?
Annie Liu (Stony Brook University)
–
Coffee and Check-In
–
Information Theory Strikes Back: New Development in the Theory of Cardinality Estimation
Dan Olteanu (University of Zurich)
–
Break
–
Reflection and Planning