A declarative approach to active databases

This position paper provides a general description of the field of active databases, focusing on the main problems yet to be solved; suggests that deductive databases may contribute to understand some of these problems; and indicates classes of applications that can be specified in a declarative way. Premise The field of active databases has recently emerged as one of the most important directions of evolution of database technology. Significant progress has been achieved both in the research environment and in the commercial world; these are reflected on one side by the relative1 large number of recent articles on the subject (see [12]), and on the other side by the increas-ing number of research prototypes and commercial systems which provide active behavior (see [ 13,16,19]). In general, this behavior is supported through inte-grated, low-level production rule facilities allowing for the automatic execution of data manipulation opera-tions when certain events occur and/or certain condi-tions are met. In spite of the rapid development of this field, sev-eral problems remain to be solved in order for active databases to become widespread and fully accepted. A first problem concerns the understanding of the semantics of a collection of production rules. This amounts to underst anding precisely under which con-ditions rules are executed and the effect of their execu-tion. Difficulties are mostly due to the variety of pro-duction rules which have been proposed; differences are due to: 0 The event upon which a rule is triggered:- A database modification (through insert, delete, or update operations).- A retrieval operation.- A time-related event. 0 The rule consideration time with respect to transactions. Rules can be executed in the context of the transactions that update the database, or be executed asynchronously. In the former case, rule consideration can be:- After each update operation.- At user-defined rule execution points