Abstract
We present a language extension to Datalog which allows to specify deterministic update procedures in a declarative way. Existing update languages either rely on procedural aspects of program evaluation or leave the framework of deductive databases and logic programming. In contrast, we show that declarative update semantics can be attained by incorporating state terms into the language. Since the resulting language corresponds to a certain class of logic programs, well-known semantics and evaluation techniques can be applied to it.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul. Updates, a new frontier. In ICDT’88 (Second Intl. Conf. on Data Base Theory), Bruges, LNCS 826, pages 1–18. Springer—Verlag, 1988.
S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43, 1991.
K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89 — 148. Morgan Kaufmann, 1988.
A. J. Bonner and M. Kifer. Transaction logic programming. Technical Report CSRI-270, Computer Systems Research Institute, University of Toronto, 1993.
F. Bry. Intensional updates: Abduction via deduction. In Proc. of the Intl. Conference on Logic Programming, 1990.
F. Bry. Towards intelligent databases. In Proc. of the Intl. Symposium on Methodologies for Intelligent Systems, LNCS. Springer, 1993.
J. Chomicki. Functional Deductive Databases: Query Processing in the Presence of Limited Function Symbols. PhD thesis, Rutgers University, 1990.
J. Chomicki and T. Imielinski. Temporal deductive databases and infinite objects. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems1988.
J. Chomicki and T. Imielinski. Finite representation of infinite query answers. ACM Transactions on Database Systems, June 1993.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors Proc. of the Intl. Conference on Logic Programmingpages 1070–1080, 1988.
S. Ghandeharizadeh, R. Hull, D. Jacobs, J. Castillo, M. Escobar-Molano, S.-H. Lu, J. Luo, C. Tsang, and G. Zhou. On implementing a language for specifying active database execution models. In Proc. of the Intl. Conference on Very Large Data Bases1993.
M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. of the Intl. Conference on Very Large Data Bases, 1992.
D. Laurent, V. Phan Luong, and N. Spyratos. Updating intensional predicates in deductive databases. In Proc. of the IEEE Intl. Conference on Data Engineering1993.
G. Lausen and B. Ludäscher. Updates by reasoning about states. Technical Report 59, Universität Freiburg, Institut für Informatik, Sept. 1994.
S. Manchanda and D. S. Warren. A logic-based language for database updates. In J. Minker, editor Foundations of Deductive Databases and Logic Programmingpages 363–394. Morgan-Kaufmann, Los Altos, CA, 1988.
S. Naqvi and R. Krishnamurthy. Database updates in logic programming. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems pages 251–262, 1988.
T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor Foundations of Deductive Databases and Logic Programmingpages 191 — 216. Morgan Kaufmann, 1988.
R. Ramakrishnan, D. Srivastava, S. Sudarshan, and P. Seshadri. Implementation of the coral deductive database system. In Proc. of the ACM SIGMOD Conference on Management of Data1993.
K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proc. of the ACM SIGMOD Conference on Management of Data1994.
J. D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, New York, 1988.
A. Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, editor Foundations of Deductive Databases and Logic Programmingpages 149–176. Morgan Kaufmann, 1988.
A. Van Gelder, K. Ross, and J. Schlipf. The well-founded sematics for general logic programs. JA CM, 38(3):620 — 650, 7 1991.
C. Zaniolo. A unified semantics for active and deductive databases. In Proceedings of the Workshop on Rules in Database SystemsWorkshops in Computing, Edinburgh, U.K., 1993. Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lausen, G., Ludäscher, B. (1995). Updates by Reasoning about States. In: Eder, J., Kalinichenko, L.A. (eds) East/West Database Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3577-7_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3577-7_2
Publisher Name: Springer, London
Print ISBN: 978-3-540-19946-5
Online ISBN: 978-1-4471-3577-7
eBook Packages: Springer Book Archive