Reconciling Active and Deductive Databases by States
We propose a state-oriented extension to Datalog called Statelog which comprises two kinds of rules, passive query rules and active transition rules within a simple, yet flexible logical framework. Statelog programs have deterministic model-theoretic semantics for queries and updates thus reconcilin...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Text |
| Language: | English |
| Published: |
1995
|
| Subjects: | |
| Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2089 http://www.sdsc.edu/~ludaesch/Paper/tr70-95.ps.gz |
| Summary: | We propose a state-oriented extension to Datalog called Statelog which comprises two kinds of rules, passive query rules and active transition rules within a simple, yet flexible logical framework. Statelog programs have deterministic model-theoretic semantics for queries and updates thus reconciling active and deductive databases. Using the Statelog framework we prove that termination of active rules is undecidable in general and introduce the class of \Delta-monotone programs for which termination is guaranteed. This class provides a generalization to previous results for Statelog and is of practical importance as it includes self-triggering recursive rules. Formal results characterizing the expressiveness and complexity are established which carry over to related state-oriented extensions of Datalog. Computing Reviews Classification: H.2.3 [Database Management]: Languages --- data manipulation languages (DML); H.2.4 [Database Management]: Systems --- query processing Additional K. |
|---|