ACM Home Page
Please provide us with feedback. Feedback
A denotational semantics for the Starburst production rule language
Full text PdfPdf (493 KB)
Source ACM SIGMOD Record archive
Volume 21 ,  Issue 3  (September 1992) table of contents
Pages: 4 - 9  
Year of Publication: 1992
ISSN:0163-5808
Author
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 14
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/140979.140980
What is a DOI?

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
 
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
 
14
 
15
16

CITED BY  14