Abstract
We show how the dynamics of database systems can be modeled by making states first-class citizens in an object-oriented deductive database language. With states at the same time acting as objects, methods, or classes, several concepts of dynamic entities can be implemented, allowing an intuitive, declarative modeling of the application domain. Exploiting the natural stratification induced by the state sequence, the approach also provides an implementable operational semantics.
The method is applicable to arbitrary object-oriented deductive database languages which provide a sufficiently flexible syntax and semantics. Provided an implementation of the underlying database language, any specification in the presented framework is directly executable, thus unifying specification, implementation, and metalanguage for proving properties of a system.
The concept is applied to F-Logic. Besides the declarative semantics given by the rules of a State-F-Logic program, the use of F-Logic's inheritance semantics for modeling states provides an effective operational semantics exploiting the naturally given state-stratification. State-F-Logic programs can be executed using the Florid implementation.
Supported by grant no. GRK 184/1-97 of the Deutsche Forschungsgemeinschaft.
Supported by the Deutsche Forschungsgemeinschaft, La 598/3-2.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8(3), September 1989.
M. Baudinet, J. Chomicki, and P. Wolper. Temporal Deductive Databases. In Tansel et al. [TCG+93].
A. J. Bonner and M. Kifer. An Overview of Transaction Logic. Theoretical Computer Science, 133(2):205–265, 1994.
P. Cholak and H. A. Blair. The Complexity of Local Stratification. Fundamenta Informaticae, 21(4), 1994.
W. Cellary and G. Jomier. Consistency of Versions in Object-Oriented Databases. In Proc. Intl. Conference on Very Large Data Bases, pages 432–441, 1990.
J. Frohn, R. Himmeröder, P.-T. Kandzia, G. Lausen, and C. Schlepphorst. FLORID: A Prototype for F-Logic. In Proc. Intl. Conference on Data Engineering, 1997.
J. Frohn, R. Himmeröder, P.-T. Kandzia, and C. Schlepphorst. How to Write F-Logic Programs in FLORID, 1996. Available from ftp://ftp.informatik.uni-freiburg.de/pub/florid/tutorial.ps.gz.
A. A. A. Fernandes, M. H. Williams, and N. W. Paton. A Logic-Based Integration of Active and Deductive Databases. New Generation Computing, 1997. to appear.
M. Kramer, G. Lausen, and G. Saake. Updates in a Rule-Based Language for Objects. In Proc. Intl. Conference on Very Large Data Bases, Vancouver, 1992.
M. Kifer, G. Lausen, and J. Wu. Logical Foundations of Object-Oriented and Frame-Based Languages. Journal of the ACM, 42(4):741–843, July 1995.
B. Ludäscher, W. May, and G. Lausen. Nested Transactions in a Logical Language for Active Rules. In D. Pedreschi and C. Zaniolo, editors, Proc. Intl. Workshop on Logic in Databases (LID), number 1154 in LNCS, pages 196–222, San Miniato, Italy, 1996. Springer.
[TCG+93] A. U. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases. Benjamin/Cummings, 1993.
C. Zaniolo. A Unified Semantics for Active and Deductive Databases. In N. W. Paton and M. H. Williams, editors, Proc. of the 1st Intl. Workshop on Rules in Database Systems (RIDS), Workshops in Computing, Edinburgh, Scotland, 1993. Springer.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
May, W., Schlepphorst, C., Lausen, G. (1997). Integrating dynamic aspects into deductive object-oriented databases. In: Geppert, A., Berndtsson, M. (eds) Rules in Database Systems. RIDS 1997. Lecture Notes in Computer Science, vol 1312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63516-5_15
Download citation
DOI: https://doi.org/10.1007/3-540-63516-5_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63516-1
Online ISBN: 978-3-540-69588-2
eBook Packages: Springer Book Archive