Compiling complex database transition triggers
Donald Cohen · ACM SIGMOD Record · 1989
This paper presents a language for specifying database updates, queries and rule triggers, and describes how triggers can be compiled into an efficient mechanism. The rule language allows specification of both state and transition constraints as special cases, but is more general than either. The implementation we describe compiles rules and updates independently of each other. Thus rules can be added or deleted without recompiling any update program and vice versa.
Cited by 70 works. doi:10.1145/66926.66947
Authors
References
- Common LISP. The language
- Implementation of integrity constraints and views by query modification
- Functional specifications of a subsystem for data base integrity
- Semantic integrity in a relational data base system
- On the efficient implementation of production systems.
- Logic for improving integrity checking in relational data bases?
- Efficient monitoring of database assertions
- The POSTGRES Papers
- Automatic compilation of logical specifications into efficient programs
- Knowledge-based Integrity Constraint Validation