|
ABSTRACT
Researchers often complain that the behavior of database production rules is difficult to reason about and understand, due in part to the lack of formal declarative semantics. It has even been claimed that database production rule languages inherently cannot be given declarative semantics, in contrast to, e.g., deductive database rule languages. In this short paper we dispute this claim by giving a denotational semantics for the Starburst database production rule language.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
Alexander Aiken , Jennifer Widom , Joseph M. Hellerstein, Behavior of database production rules: termination, confluence, and observable determinism, ACM SIGMOD Record, v.21 n.2, p.59-68, June 1, 1992
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
[HW92] E.N. Hanson and J. Widom. Rule processing in active database systems. In L. Delcambre and F. Petty, editors, Advances in Databases and Artificial Intelligence. JAI Press, Greenwich, Connecticut, 1992.
|
| |
9
|
[KdMS92] J. Kiernan, C. de Maindreville, and E. Simon. Supporting deductive and active rules on top of a relational DBMS. Research report, INRIA, Le Chesnay, France, 1992.
|
 |
10
|
|
| |
11
|
|
| |
12
|
[Sel89] T. Sellis, editor. Special lssue on Rule Management and Processing in Expert Database Systems, SIGMOD Record 18(3), September 1989.
|
 |
13
|
Michael Stonebraker , Anant Jhingran , Jeffrey Goh , Spyros Potamianos, On rules, procedure, caching and views in data base systems, Proceedings of the 1990 ACM SIGMOD international conference on Management of data, p.281-290, May 23-26, 1990, Atlantic City, New Jersey, United States
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
|