How can the result of a query be updated after changing a database? This is a fundamental task for database management systems which ideally takes previously computed information into account. In dynamic complexity theory, it is studied from a theoretical perspective where updates are specified by rules written in first-order logic. In this article we sketch recent techniques and results from dynamic complexity theory with a focus on the reachability query.

中文翻译：

---

动态复杂性的草图

更改数据库后如何更新查询结果？这是数据库管理系统的一项基本任务，它理想地考虑了先前计算的信息。在动态复杂性理论中，它是从理论角度研究的，其中更新由以一阶逻辑编写的规则指定。在本文中，我们概述了动态复杂性理论的最新技术和结果，重点是可达性查询。