Logic and Algorithms In Database Theory and AI
summary
Frames a database as a collection of hypergraph databases and maps concrete problems — triangles as conjunctive queries, APSP as a recursive logical query — to specific algorithmic paradigms. Explores practical tools like sketching and sampling for approximate answers, and analyzes exact performance via fine-grained complexity and fixed-parameter lenses. Connects incremental view maintenance to dynamic algorithms, outlines a program of four workshops and active collaborations, and reports that the framework produces actionable reductions between query languages and algorithmic techniques for both static and update-heavy settings.
AI-written summary · about
related talks
43mAnalytics and AI Applied to Graph Databases - Introduction and Demo
29mThinking in Graphs – An Intro to Graph Databases & Applications
44mIntermediate Relational Algorithm Design
57mAlgebraic Databases
55mA Practical Guide to Graph Databases
36mOptimizing Relational Programs II
20mPolygon: Symbolic Reasoning for SQL using Conflict-Driven Under-Approximation Search
47mApproximate Lifted Inference with Probabilistic Databases