This Article 
 Bibliographic References 
 Add to: 
Incremental Recomputation of Active Relational Expressions
September 1991 (vol. 3 no. 3)
pp. 337-341

Database updates are small and incremental compared to database contents. It is therefore desirable that recomputations of active relational expressions-such as views, derived data, integrity constraints, active queries, and monitors-can also be performed incrementally. An efficient algorithm for the incremental recomputation of active relational expressions based on finite differencing techniques is presented. Database updates are modeled as incremental changes to database relations, and the algorithm derives, by update propagation, the minimal incremental relational expressions that need recomputation. The algorithm has applications in the maintenance of materialized views and derived data, the checking of integrity constraints, and the evaluation of active queries and monitors.

[1] P. Bernstein, B. Blaustein, and E. Clarke, "Fast maintenance of semantic integrity assertions using redundant aggregate data," inProc. Sixth Int. Conf. Very Large Data Bases, 1980, pp. 126-136.
[2] J. Blakeley, P. Larson, and F. Tompa, "Efficiently updating materialized views," inProc. ACM-SIGMOD Int. Conf Management of Data, Washington, May 28-30, 1986.
[3] O. P. Buneman and E. K. Clemons, "Efficiently monitoring relational databases,"Trans. Database Syst., vol. 4, no. 3, pp. 368-382, 1979.
[4] L. Henschen, W. McCune, and S. Naqvi, "Compiling constraint-checking programs from first-order formulas," inAdvances in Database Theory, Vol. 2, H. Gallaire, J. Minker, and J-M. Nicolas, Eds. New York: Plenum, 1984, pp. 145-170.
[5] S. Hudson and R. King, "The Cactis Project: Database support for software environments,"IEEE Trans. Software Eng., vol. 14, pp. 709-719, June 1988.
[6] R. Katz and E. Chang, "Managing change in a computer-aided design database," inProc. VLDB, 1987.
[7] S. Koenig and R. Paige, "A transformational framework for the automatic control of derived data," inProc. Seventh Int. Conf. Very Large Data Bases, 1981, pp. 306-318.
[8] D. McCarthy and U. Dayal, "The Architecture of an Active Data Base Management System,"Proc. ACM SIGMod, ACM Press, New York, 1989, pp. 215- 224.
[9] J-M. Nicolas, "Logic for improving integrity checking in relational data bases,"Acta Informatica, vol. 18, pp. 227-253, 1982.
[10] R. Paige, "Applications of finite differencing to database integrity control and query/transaction optimization," inAdvances in Database Theory, Vol. 2, H. Gallaire, J. Minker, and J-M. Nicolas, Eds. New York: Plenum, 1984, pp. 171-209.
[11] R. Paige and S. Koenig, "Finite differencing of computable expressions,"ACM Trans. Program. Lang. Syst., vol. 4, no. 3, pp. 402- 454, July 1982.
[12] X. Qian, "An effective method for integrity constraint simplification," inProc. Fourth Int. Conf. Data Eng., 1988, pp. 338-345.
[13] T. Risch, "Monitoring Database Objects,"Proc. 15th Int'l Conf. Very Large Databases, VLDB Foundation, 1989, pp. 445- 453.
[14] A. Rosenthal, S. Chakravarthy, and B. Blaustein, "Situation monitoring for active databases," inProc. Fifteenth Int. Conf. Very Large Data Bases, 1989, pp. 455-464.
[15] M. Stonebraker, "Implementation of integrity constraints and views by query modification," inProc. 1975 ACM-SIGMOD Int. Conf. Management of Data, San Jose, CA, June 1975.
[16] G. Wiederhold, T. Barsalou, and S. Chaudhuri, "Managing objects in a relational framework," Tech. Rep. STAN-CS-89-1245, Dep. Comput. Sci., Stanford Univ., 1989.

Index Terms:
database updates; active relational expressions; views; derived data; integrity constraints; active queries; monitors; incremental recomputation; finite differencing techniques; update propagation; materialized views; data integrity; query languages; relational databases
X. Qian, G. Wiederhold, "Incremental Recomputation of Active Relational Expressions," IEEE Transactions on Knowledge and Data Engineering, vol. 3, no. 3, pp. 337-341, Sept. 1991, doi:10.1109/69.91063
Usage of this product signifies your acceptance of the Terms of Use.