Qian and Wiederhold (1991) presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain minimality 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.
No takes yet. Share an insight, caveat, or question.
Griffin et al. (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: