A logical semantics for object-oriented databases
Authors:
Open Access
- 1 June 1993
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 22 (2) , 89-98
Abstract
Although the mathematical foundations of relational databases are very well established, the state of affairs for object-oriented databases is much less satisfactory. We propose a semantic foundation for object-oriented databases based on a simple logic of change called rewriting logic , and a language called MaudeLog that is based on that logic. Some key advantages of our approach include its logical nature, its simplicity without any need for higher-order features, the fact that dynamic aspects are directly addressed, the rigorous integration of user-definable algebraic data types within the framework, the existence of initial models, and the integration of query, update, and programming aspects within a single declarative language.Keywords
This publication has 17 references indexed in Scilit:
- Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operationsTheoretical Computer Science, 1992
- Toward megaprogrammingCommunications of the ACM, 1992
- Conditional rewriting logic as a unified model of concurrencyTheoretical Computer Science, 1992
- Bulk types for large scale programmingLecture Notes in Computer Science, 1991
- Method schemas1990
- Rewrite Systems1990
- Order-sorted unificationJournal of Symbolic Computation, 1989
- Inheritance hierarchies: Semantics and unificationJournal of Symbolic Computation, 1989
- F-logic: a higher-order language for reasoning about objects, inheritance, and scheme1989
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980