| 2026.07.17 |
Value Polymorphism in
Rust |
| 2026.06.06 |
Passing DBs Through Continuations |
| 2026.04.30 |
Simple and Correct Snapshot Isolation |
| 2026.04.28 |
Teaching Tricks |
| 2026.01.24 |
Join Trees, the "Hard" Way |
| 2026.01.23 |
Early History of a Perfect Join
Algorithm |
| 2025.12.31 |
4 Ways to Improve A Perfect Join
Algorithm |
| 2025.12.15 |
A Perfect Join Algorithm |
| 2025.08.08 |
DuckDB Considered Harmful |
| 2025.07.07 |
Method of Four Russians |
| 2025.03.19 |
Completeness of Equality Saturation |
| 2025.03.17 |
Reading Papers in a Paper-Reading
Seminar |
| 2023.12.06 |
Duality in Linear Programming |
| 2023.11.01 |
The Entropic Framework for Cardinality
Bounds |
| 2023.08.03 |
Relative Safety in Relational
Calculus |
| 2023.07.26 |
How to Check 2 SQL Tables are the
Same |
| 2023.02.08 |
Datalog resources |
| 2023.01.31 |
Late materialization is (almost)
worst-case optimal |
| 2023.01.30 |
AGM bound for transitive
closure |
| 2021.04.27 |
Counterexample-guided inductive
synthesis |
| 2021.04.27 |
Generic join algorithms |
| 2021.01.17 |
E-graph intersection |
| 2020.06.17 |
Fundamental entropic bounds |
| 2020.06.17 |
Entropy |
| 2019.02.13 |
A canonicity proof via gradient
induction |