Abstract
Semantics represents a major problem area for active databases in as much as (i) there is no formal framework for defining an implementation-independent semantics of active rules, and (ii) the various systems developed so far have ad-hoc operational semantics that are widely different from each other. This situation contributes to the difficulty of predicting the run-time behavior of sets of rules: thus, ensuring the termination of a given set of rules is currently viewed as a major research issue. In this paper, we introduce a durable change semantics for active database rules; this semantics improves Starburst's deferred activation notion with concepts taken from Postgres and Heraclitus and the semantic foundations of deductive databases. We provide a formal logic-based model for this transaction-oriented semantics, show that it is amenable to efficient implementation, and prove that it solves the non-termination problem.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aiken, A. J. Widom, J. M. Hellerstein. Behavior of Database Production Rules: Termination, Confluence and Observable Termination. In ACM SIGMOD Int. Conf. on Management of Data, pages 59–68, 1992.
M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, Proc. 5th Int. Conf. on Logic Programming, MIT Press, 1988.
M.L. Stonebraker, A. Jhingran, J. Goh, and S. Potamianos. On rules, procedure, cacheing and views in data base systems. In ACM SIGMOD Int. Conf. on Management of Data, pages 281–290, 1990.
J. Chomicki, Temporal deductive databases, Temporal Databases: Theory, Design and Implementation, A. Tansel et al. (eds), Benjamin/Cummings, 1993.
J. Chomicki, “Polynomial-time Computable Queries in Temporal Deductive Database Systems,” PODS 1990.
S. Ghandeharizadeh, R. Hull and D. Jacobs, “On Implementing a Language for Specifying Active Database Execution' Models, Procs. Int. Conf. on Very Large Databases, 1993.
D. McCarty and U. Dayal. The architecture of an active database management system. In ACM SIGMOD International Conf. on Management of Data, pages 215–224, 1989.
N.H. Gehani and H.V. Jagadish. Ode as an active database: Constraints and triggers. Seventeenth Int. Conf. on Very Large Data Bases, Barcelona, pages 327–336, 1991.
Widom J., “The Starburst Active Database Rule System”, To appear in IEEE Trans. On Knowledge and Data Engineering.
U. Dayal, E.N. Hanson, and J. Widom Active Database Systems, ”Modern Database Systems, W. Kim (ed.), Addison Wesley, 1995.
Y. Motakis, and C. Zaniolo, Composite Temporal Events in Active Databases: a Formal Semantics, submitted for publication.
J.S. Schlipf, The expressive powers of logic programming semantics, Proc. ACM-PODS, 1990, 196–204.
Zaniolo, C., N. Arni, K. Ong, “Negation and Aggregates in Recursive Rules: the LDL++ Approach”, Proc. 3rd Int. Conf. on Deductive and 0-0 DBs, DOOD-93, Phoenix, AZ, Dec 6–8, 1993.
C. Zaniolo, “A unified semantics for active and deductive databases”, In Procs. 1st Int. Workshop on Rules in Database Systems, pages 271–287, Springer-Verlag, 1993
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zaniolo, C. (1995). Active database rules with transaction-conscious stable-model semantics. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds) Deductive and Object-Oriented Databases. DOOD 1995. Lecture Notes in Computer Science, vol 1013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60608-4_34
Download citation
DOI: https://doi.org/10.1007/3-540-60608-4_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60608-6
Online ISBN: 978-3-540-48460-8
eBook Packages: Springer Book Archive