Incremental Homomorphism Search

This Berkeley Seminar features Kris Brown discussing "Incremental homomorphism search," a mathematical approach to efficiently updating query results when underlying data changes slightly. Learn how incremental search can be more efficient than recalculating answers from scratch, especially when working with anticipated changes. The talk begins with relational databases modeled as ACSets, where homomorphisms Hom(Q, X) represent query results, then generalizes to categories with appropriate structure. Explore this work-in-progress research that has applications in computational efficiency for database queries and mathematical structures. The presentation is part of the Topos Institute's Berkeley Seminar series and includes references to additional resources available on the speaker's website.