文章基本信息

标题：Dynamic Complexity under Definable Changes
本地全文：下载
作者：Thomas Schwentick ; Nils Vortmeier ; Thomas Zeume 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：68
页码：19:1-19:18
DOI：10.4230/LIPIcs.ICDT.2017.19
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free first-order formulas, all (uniform) AC1 queries can be maintained by first-order dynamic programs. Furthermore, many maintenance results for single-tuple changes are extended to more powerful change operations: (1) The reachability query for undirected graphs is first-order maintainable under single tuple changes and first-order defined insertions, likewise the reachability query for directed acyclic graphs under quantifier-free insertions. (2) Context-free languages are first-order maintainable under \EFO-defined changes. These results are complemented by several inexpressibility results, for example, that the reachability query cannot be maintained by quantifier-free programs under definable, quantifier-free deletions.
关键词：dynamic descriptive complexity; SQL updates; dynamic programs