This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
May-June 1997 (vol. 9 no. 3)
pp. 508-511

Abstract—In [1], Qian and Wiederhold 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.

[1] X. Qian and G. Wiederhold, Incremental Recomputation of Active Relational Expressions IEEE Trans. Knowledge and Data Eng. (TKDE), vol. 3, no. 3, pp. 337-341, Sept. 1991.
[2] T. Griffin and L. Libkin, "Incremental Maintenance of Views with Duplicates," Proc. ACM SIGMOD Int'l Conf. Management of Data,San Jose, Calif., 1995.

Index Terms:
Relational algebra, incremental recomputation, change propagation, view maintenance.
Citation:
Timothy Griffin, Leonid Libkin, Howard Trickey, "An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 3, pp. 508-511, May-June 1997, doi:10.1109/69.599937
Usage of this product signifies your acceptance of the Terms of Use.