Incremental Recomputation of Active Relational Expressions

IEEE Transactions on Knowledge and Data Engineering

Volumn 3, Issue 3, 1991, Pages 337-341

  Qian, Xiaolei ^a   Wiederhold, Gio ^b  

^a KESTREL INSTITUTE   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

ACTIVE RELATIONAL EXPRESSIONS; DATABASE UPDATES; INCREMENTAL RECOMPUTATION; INTEGRITY CONSTRAINTS;

DATABASE SYSTEMS;

EID: 0026223086     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/69.91063     Document Type: Article

References (16)

1. P. Bernstein, B. Blaustein, and E. Clarke, “Fast maintenance of semantic integrity assertions using redundant aggregate data,” in Proc. Sixth Int. Conf. Very Large Data Bases, 1980, pp. 126–136.
2. J. Blakeley, P. Larson, and F. Tompa, “Efficiently updating materialized views,” in Proc. ACM SIGMOD Int. Conf. Management Data, 1986, pp. 61–71.
3. P. Buneman and E. Clemons, “Efficiently monitoring relational databases,” ACM Trans. Database Syst., vol. 4, no. 3, pp. 368–382, Sept. 1979.
4. L. Henschen, W. McCune, and S. Naqvi, “Compiling constraint-checking programs from first-order formulas,” in Advances in Database Theory, Vol. 2, H. Gallaire, J. Minker, and J-M. Nicolas, Eds. New York: Plenum, 1984, 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 CAD database,” in Proc. Thirteenth Int. Conf Very Large Data Bases, 1987, 455–462.
7. S. Koenig and R. Paige, “A transformational framework for the automatic control of derived data,” in Proc. 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,” in Proc. ACM SIGMOD Int. Conf Management Data, 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,” in Advances 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. Programming Languages Syst., vol. 4, no. 3, pp. 402–454, July 1982.
12. X. Qian, “An effective method for integrity constraint simplification,” in Proc. Fourth Int. Conf. Data Eng., 1988, pp. 338–345.
13. T. Risch, “Monitoring database objects,” in Proc. Fifteenth Int. Conf Very Large Data Bases, 1989, pp. 445-453.
14. A. Rosenthal, S. Chakravarthy, and B. Blaustein, “Situation monitoring for active databases,” in Proc. Fifteenth Int. Conf Very Large Data Bases, 1989, pp. 455-464.
15. M. Stonebraker, “Implementation of integrity constraints and views by query modification,” in Proc. ACM SIGMOD Int. Conf Management Data, 1975, 65–78.
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.