LIPIcs.ICDT.2018.3.pdf
- Filesize: 156 kB
- 1 pages
Document
An Update on Dynamic Complexity Theory
Author
-
Part of:
Volume:
21st International Conference on Database Theory (ICDT 2018)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Database Theory (ICDT) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2018-03-05
Cite AsGet BibTex
Thomas Zeume. An Update on Dynamic Complexity Theory. In 21st International Conference on Database Theory (ICDT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 98, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ICDT.2018.3
https://doi.org/10.4230/LIPIcs.ICDT.2018.3
Abstract
In many modern data management scenarios, data is subject to frequent changes. In order to avoid costly re-computing query answers from scratch after each small update, one can try to use auxiliary relations that have been computed before. Of course, the auxiliary relations need to be updated dynamically whenever the data changes.
Dynamic complexity theory studies which queries and auxiliary relations can be updated in a highly parallel fashion, that is, by constant-depth circuits or, equivalently, by first-order formulas
or the relational algebra. After gently introducing dynamic complexity theory, I will discuss recent results of the area with a focus on the dynamic complexity of the reachability query.
Keywords
- Dynamic descriptive complexity
- SQL updates
- Reachability
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads