The PARK semantics for active rules

Georg Gottlob, Guido Moerkotte, V. S. Subrahmanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


Active databases are an important topic of current database research. However, the semantics of the underlying mechanism, event-condition-action rules (or EC A rules for short), is unclear so far. In order to define a clear semantics for sets of active rules, we first derive the requirements such a semantics must fulfill. Since currently no semantics fulfills these requirements, we continue with the definition of the PARK semantics adhering to all requirements. The PARK semantics is a smooth integration of inflationary fixpoint semantics [7] with conflict resolution. Through this approach, the PARK semantics is powerful enough to deal with recursive active rules. Furthermore, the actual conflict resolution strategy is a parameter of the PARK semantics. This guarantees a wide range of applicability.

Original languageEnglish (US)
Title of host publicationAdvances in Database Technology, EDBT 1996 - 5th International Conference on Extending Database Technology, Proceedings
EditorsPeter Apers, Mokrane Bouzeghoub, Georges Gardarin
PublisherSpringer Verlag
Number of pages21
ISBN (Print)354061057X, 9783540610571
StatePublished - 1996
Externally publishedYes
Event5th international conference on Extending Data Base Technology, EDBT 1996 - Avignon, France
Duration: Mar 25 1996Mar 29 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1057 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference5th international conference on Extending Data Base Technology, EDBT 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'The PARK semantics for active rules'. Together they form a unique fingerprint.

Cite this