Query Modification in Object-oriented Database Federation

We discuss the modification of queries against an integrated view in a federation of object-oriented databases. We present a generalisation of existing algorithms for simple global query processing that works for arbitrarily defined integration classes. We then extend this algorithm to deal with object-oriented features such as queries involving path expressions and nesting. We show how properties of the OO-style of modelling relationships through object references can be exploited to reduce the number of subqueries necessary to evaluate such querie

Asynchronous data retrieval from an object-oriented database

We present an object-oriented semantic database model which, similar to other object-oriented systems, combines the virtues of four concepts: the functional data model, a property inheritance hierarchy, abstract data types and message-driven computation. The main emphasis is on the last of these four concepts. We describe generic procedures that permit queries to be processed in a purely message-driven manner. A database is represented as a network of nodes and directed arcs, in which each node is a logical processing element, capable of communicating with other nodes by exchanging messages. This eliminates the need for shared memory and for centralized control during query processing. Hence, the model is suitable for implementation on a multiprocessor computer architecture, consisting of large numbers of loosely coupled processing elements

Automatic Verification of Transactions on an Object-Oriented Database

In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead due to integrity constraint checking. The higher-order logic Isabelle theorem prover is used to automatically prove which constraints might, or might not be violated by a given transaction in a manner analogous to the one used by Sheard and Stemple (1989) for the relational data model. A prototype transaction verification tool has been implemented, which automates the semantic mappings and generates proof goals for Isabelle. Test results are discussed to illustrate the effectiveness of our approach

A theorem prover-based analysis tool for object-oriented databases

We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (such as transaction safety, compensation, and commutativity) to support the advanced transaction models used in workflow and cooperative work. We give an example of method safety analysis for the generic structure editing operations of a cooperative authoring system

A database model for object dynamics.

Object-oriented database systems, Dynamic object re-classification, Object role model, Dynamic class hierarchy, Object migration

The GOODSTEP project: General Object-Oriented Database for Software Engineering Processes

The goal of the GOODSTEP project is to enhance and improve the functionality of a fully object-oriented database management system to yield a platform suited for applications such as software development environments (SDEs). The baseline of the project is the O2 database management system (DBMS). The O2 DBMS already includes many of the features regulated by SDEs. The project has identified enhancements to O2 in order to make it a real software engineering DBMS. These enhancements are essentially upgrades of the existing O2 functionality, and hence require relatively easy extensions to the O2 system. They have been developed in the early stages of the project and are now exploited and validated by a number of software engineering tools built on top of the enhanced O2 DBMS. To ease tool construction, the GOODSTEP platform encompasses tool generation capabilities which allow for generation of integrated graphical and textual tools from high-level specifications. In addition, the GOODSTEP platform provides a software process toolset which enables modeling, analysis and enaction of software processes and is also built on top of the extended O2 database. The GOODSTEP platform is to be validated using two CASE studies carried out to develop an airline application and a business application

Querying an Object-Oriented Database Using CPL

The Collection Programming Language is based on a complex value model of data and has successfully been used for querying transforming and integrating data from a wide variety of structured data sources - relational, ACeDB, and ASN.1 among others. However, since there is no notion of objects and classes in CPL, it cannot adequately model recursive types or inheritance, and hence cannot be used to query object-oriented databases (OODBs). By adding a reference type and four operations to CPL - dereference, method invocation, identity test and class type cast - it is possible to express a large class of interesting safe queries against OODBs. As an example of how the extended CPL can be used to query an OODB, we will describe how the extended language has been used as a query interface to Shore databases

A formal definition of the Users View (UV) of the Graphical Object Query Language (GOQL)

In this paper we provide a brief formal definition of the Users View (UV) of the Graphical Object Query Language(GOQL). The UV provides a graphical representation for object-oriented database schemas and hides from end-users most of the perplexing details of the object-oriented database model, such as methods, hierarchies and relationships. In particular, the UV does not distinguish between methods, attributes and relationships, encapsulates the is-a hierarchy and utilises a number of desktop metaphors to present a graphical schema that is easy to be understood by end-users. Thus, the UV provides the environment, through which end-users, can pose ad-hoc queries through GOQL. We first give a brief formal definition of an object-oriented database schema in the GOQL model. This is given, by providing a formal definition of the basic element of such a schema, namely the class. The UV is then briefly formally defined as a mapping from a GOQL object-oriented database schema. Using this mapping, any object-oriented database schema can be translated into a graphical representation in the UV. The running example of the paper is used to demonstrate the mapping from the textual schema to the graphical schema of the UV. The formal definition of the UV will allow us, in the future, to formally define the graphical constructs of GOQL