Incremental Recomputation in Local Languages
We study the problem of maintaining recursively defined views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanisms. The main results of this paper are negative ones: we show that a certain property of query languages implies impossibility of such incremental maintenance. 2003 Elsevier Science (USA). All rights reserved.
& Wong, L.
(2003). Incremental Recomputation in Local Languages. Information and Computation, 181, 88-98.