Extending a functional DBPL with ECA-rules (1995)
| Venue: | Proc. 2nd Int. Wshp. on Rules in Database Systems |
| Citations: | 8 - 2 self |
BibTeX
@INPROCEEDINGS{Reddi95extendinga,
author = {Swarup Reddi and Alex Poulovassilis and Carol Small},
title = {Extending a functional DBPL with ECA-rules},
booktitle = {Proc. 2nd Int. Wshp. on Rules in Database Systems},
year = {1995},
pages = {101--115},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We describe how a functional database programming language can be extended with transactions and ECA-rules. Fundamental requirements of such an extension are that the declarative semantics of the language not be compromised, that the syntax of the language not be disrupted unduly, and that impedance mismatch problems be avoided. We define what we mean by events, conditions and actions and describe the semantics of ECA-rules with reference to event detection, parameter-binding, transaction scheduling and abort handling. We define the execution semantics for the ECA System in the language itself. These semantics form the basis of our implementation of the ECA System. Keywords. ECA-rules, deductive databases, functional database languages, PFL. 1 Introduction This paper describes how ECA-rules can be added to PFL, a functional database programming language. PFL is "declarative" in the sense that expression evaluation is confluent i.e. the order in which the sub-expressions of an expre...
