A (Semi)Ring-Based Query Algebra for Incremental View Maintenance and Query Compilation
summary
Argues that queries form a polynomial algebra over avalanche (semi)rings so deltas become algebraic derivatives and the k-th deltas depend only on the update, not the database. Shows a compilation that materializes multi-layer auxiliary views to eliminate joins and maintain each aggregate with constant work for non-nested queries, proves update-time complexity in NC0 versus AC0 for non-incremental evaluation, and ships a prototype called DBToaster that implements these ideas (GitHub available).
AI-written summary · about
chapters (11)
- 0:00Rings in databases motivation
- 1:24Relational algebra numerical limits
- 4:12Monoid semirings for query algebra
- 8:51Monoid rings and generalized multisets
- 14:37Ring properties for bag/set semantics
- 16:47Rings for sideways information passing
- 18:57Query language with aggregation
- 21:29Recursive view maintenance deltas
- 23:56SQL compilation to incremental updates
- 26:30Complexity and dbtoaster system
- 28:17Future work in IVM
related talks
01h 05mIncremental View Maintenance 2
01h 08mIncremental View Maintenance 1
21mRecent Advances in Incremental View Maintenance
38mIncremental View Maintenance: Beyond Worst-Case Analysis I
49mIncremental Computation
26mIncremental View Maintenance: Beyond Worst-Case Analysis II
06h 54mTopical Edition on Databases - Track 1
36mOptimizing Relational Programs II
