A denotational semantics for the Starburst production rule language
- 1 September 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 21 (3), 4-9
- https://doi.org/10.1145/140979.140980
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.Keywords
This publication has 6 references indexed in Scilit:
- Behavior of database production rulesACM SIGMOD Record, 1992
- Set-oriented production rules in relational database systemsPublished by Association for Computing Machinery (ACM) ,1990
- On rules, procedure, caching and views in data base systemsPublished by Association for Computing Machinery (ACM) ,1990
- Data intensive production systems: the DIPS approachACM SIGMOD Record, 1989
- An initial report on the design of Ariel DBMS with an integrated production rule systemACM SIGMOD Record, 1989
- The architecture of an active database management systemPublished by Association for Computing Machinery (ACM) ,1989