Dynamic Complexity under Definable Changes
Dynamic Complexity under Definable Changes is a scholarly work by Thomas Schwentick, published in 2018 in ''ACM Transactions on Database Systems''. The main subjects of the publication include program analysis, Boolean conjunctive query, base, relational algebra, reachability, relational database, conjunctive query, theoretical computer science, ?-tuple, logic programming, set, discrete mathematics, fault tolerance, bounded function, computer science, and binary relation. The article extends the setting to definable changes , also specified by first-order queries on the database, and generalizes previous maintenance results to these more expressive change operations.