A logical semantics for object-oriented databases

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.

[1]  Stefano Ceri,et al.  Toward megaprogramming , 1992, CACM.

[2]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Gert Smolka,et al.  Inheritance Hierarchies: Semantics and Unification , 1989, J. Symb. Comput..

[4]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Serge Abiteboul,et al.  Objects and views , 1991, SIGMOD '91.

[6]  David A. Wolfram,et al.  On Types and FOOPS , 1990, DS-4.

[7]  HuetGérard.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980 .

[8]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[9]  José Meseguer,et al.  Parallel Programmming in Maude , 1991, Research Directions in High-Level Parallel Programming Languages.

[10]  José Meseguer,et al.  Multiparadigm Logic Programming , 1992, ALP.

[11]  Serge Abiteboul,et al.  Method schemas , 1990, PODS.

[12]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[13]  Joseph A. Goguen,et al.  Order-Sorted Unification , 1989, J. Symb. Comput..

[14]  Catriel Beeri,et al.  New data models and languages—the challenge , 1992, PODS.

[15]  Val Tannen,et al.  Logical and Computational Aspects of Programming with Sets/Bags/Lists , 1991, ICALP.

[16]  Elisa Bertino,et al.  A View Mechanism for Object-Oriented Databases , 1992, EDBT.

[17]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[18]  José Meseguer,et al.  A logical theory of concurrent objects and its realization in the Maude language , 1993 .

[19]  Gio Wiederhold,et al.  Mediators in the architecture of future information systems , 1992, Computer.

[20]  Bob Carpenter,et al.  The logic of typed feature structures , 1992 .

[21]  Catriel Beeri,et al.  Functional and predictive programming in OODB's , 1992, PODS '92.

[22]  Serge Abiteboul,et al.  Object identity as a query language primitive , 1989, SIGMOD '89.

[23]  Malcolm P. Atkinson,et al.  Bulk Types for Large Scale Programming , 1990, East/West Database Workshop.

[24]  Michael Kifer,et al.  F-logic: a higher-order language for reasoning about objects, inheritance, and scheme , 1989, SIGMOD '89.

[25]  José Meseguer,et al.  Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics , 1987, Research Directions in Object-Oriented Programming.

[26]  Gul Agha,et al.  Concurrent programming using actors , 1987 .