Issue No. 03 - May-June (1997 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.599937
<p><b>Abstract</b>—In [<ref rid="bibk05081" type="bib">1</ref>], Qian and Wiederhold presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain <it>minimality</it> condition. This condition guarantees that the incremental change sets do not contain any unnecessary tuples; so, redundant computations are not performed. We show that, in fact, their algorithm violates this condition. We present an improved algorithm that does preserve this notion of minimality.</p>
Relational algebra, incremental recomputation, change propagation, view maintenance.
L. Libkin, T. Griffin and H. Trickey, "An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions," in IEEE Transactions on Knowledge & Data Engineering, vol. 9, no. , pp. 508-511, 1997.