Abstract
Active databases are an important topic of current database research. However, the semantics of the underlying mechanism, event-condition-action rules (or ECA 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Buchmann. Active object systems. In A. Dogac, M. Özsu, A. Biliris, and T. Sellis, editors, Advances in Object-Oriented Database Systems, pages 201–224, 1994.
U. Dayal, E. Hanson, and J. Widom. Active database systems. In W. Kim, editor, Modern Database Systems, pages 434–456. Addison Wesley, 1995.
P. Fraternelli and L. Tanca. A toolkit for the design of active database semantics. Rapporto Interno 93-078, Politecnico di Milano, Milano, Italy, 1993.
P. Fraternelli and L. Tanca. A structured approach for the definition of the semantics of active databases. Rapporto Interno 95-028, Politecnico di Milano, Milano, Italy, 1995. To appear in Trans. on Database Systems.
A. Van Gelder, K. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, July 1991.
E. Hanson. Rule condition testing and action execution in ariel. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 49–58, San Diego, CA, Jun. 1992.
P. Kolaitis and C. Papadimitriou. Why not negation by fixpoint? Journal of Computer and System Sciences, 43:125–144, 1991.
A.M. Kotz. Trigger Mechanisms for Maintaining Design Data Consistency in Database Systems. PhD thesis, Univ. of Karlsruhe, 1988.
W. Marek and M. Truszczyński. Revision Programming, Database Updates, and Integrity Constraints. In Int. Conf. on Database Theory, pages 368–382, Prague, Jan. 1995. Springer.
A. Olive. On the design and implementation of information systems from deductive databases. In Proc. Int. Conf. on Very Large Data Bases, pages 3–11, 1989.
Ph. Picouet, V. Vianu. Semantics and Expressiveness Issues in Active Databases. In Proc. ACM Symposium on Principles of Database Systems, pages 126–138, 1995.
M. Stonebraker, A. Jhingran, J. Goh, and S. Potamianos. On rules, procedures, caching and views in data base systems. In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 281–290, 1990.
J. Widom and S. Finkelstein. Set-oriented production rules in relational databases. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 259–270, 1990.
C. Zaniolo. On the unification of active databases and deductive databases. In Rules in Database Systems, (N. Paton, ed.), Springer Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gottlob, G., Moerkotte, G., Subrahmanian, V.S. (1996). The PARK semantics for active rules. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds) Advances in Database Technology — EDBT '96. EDBT 1996. Lecture Notes in Computer Science, vol 1057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014142
Download citation
DOI: https://doi.org/10.1007/BFb0014142
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61057-1
Online ISBN: 978-3-540-49943-5
eBook Packages: Springer Book Archive