Affiliation:
1. TU Dortmund
2. Ruhr University Bochum
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Work-sensitive Dynamic Complexity of Formal Languages;Lecture Notes in Computer Science;2021
2. The Dynamic Complexity of Acyclic Hypergraph Homomorphisms;Graph-Theoretic Concepts in Computer Science;2021
3. Dynamic Complexity of Expansion;Computer Science – Theory and Applications;2021