5 research outputs found
View maintenance in object-oriented databases
in this paper, we present a model that facilitates view maintenance within object-oriented databases. For that purpose, we differentiate between two categories of classes, base classes and brother classes. While the former constitute the actual database, the latter are introduced to hold virtual database, i.e., views derived from base classes. To achieve incremental view update, we introduce a modification list into each base class. A series of algorithms are developed to serve the purpose. Finally it happened that, view maintenance within object-oriented databases subsumes that within the nested and hence conventional relational models
Query model for object-oriented databases
A query language should be a part of any database system. While the relational model has a well defined underlying query model, the object-oriented database systems have been criticized for not having such a query model. One of the most challenging steps in the development of a theory for object-oriented databases is the definition of an object algebra. A formal object-oriented query model is described here in terms of an object algebra, at least as powerful as the relational algebra, by extending the latter in a consistent manner. Both the structure and the behavior of objects are handled. An operand and the output from a query in the object algebra are defined to have a pair of sets, a set of objects and a set of message expressions where a message expression is a valid sequence of messages. Hence the closure property is maintained in a natural way. In addition, it is proved that the output from a query has the characteristics of a class; hence the inheritance (sub/superclass) relationship between the operand(s) and the output from a query is derived. This way, the result of a query can be persistently placed in its proper place in the lattice
Incremental materialization of object-oriented views
We present an approach to handle incremental materialization of object-oriented views. Queries that define views are implemented as methods that are invoked to compute corresponding views. To avoid computation from scratch each time a view is accessed, we introduce some deferred update algorithms that reflect for a view only related modifications introduced into the database while that view was inactive. A view is updated by considering modifications performed within all classes along the inheritance and class-composition subhierarchies rooted at every class used in deriving that view. To each class, we add a modification list to keep one modification tuple per view dependent on that class. Such a tuple acts as a reference point that marks the start of the next update to the corresponding view. © 1999 Elsevier Science B.V. All rights reserved
A query model and an object algebra for object-oriented databases
Ankara : The Department of Computer Engineering and Information Science and the Institute of Engineering and Science of Bilkent University, 1993.Thesis (Ph. D.) -- Bilkent University, 1993.Includes bibliographical references leaves 99-109.A query model is an important component of any database system. In this sense,
the relational model has a well defined underlying query model. On the other hand,
a well defined query model for object-oriented databases has not been accepted yet.
This is one of the common complaints against object-oriented databases. So defining
a formal object algebra is one of the most challenging steps in developing a theory for
object-oriented databases. In object-oriented data models, although messages serve to
manipulate the database, a query model is still required to effectively deal with more
complex situations and to facilitate associative access. In this thesis, a query model
for object-oriented databases is described, where both the structure and the behavior of
objects are handled. Not only the manipulation of existing objects, but also the creation
of new objects and the introduction of new relationships are supported in the model.
Equivalents to the five basic operations of the relational model as ivell as other additional
operations such as one level project, nest and aggregate function application are defined.
Hence, the proposed object algebra subsumes the relational algebra. Linear recursion
is also supported without requiring any additional operator to serve the purpose. Both
the operands as well as the results of these operations are characterized as having a
pair of sets -a set of objects and a set of message expressions (sequences of messages)
applicable to them. The closure property is shown to be preserved in a natural way
by the results of operations possessing the same characteristics as the operands in a
query. It is shown that every class possesses the properties of an operand by defining
a set of objects and deriving a set of message expressions for it. Furthermore, it is
shown that the output of a query has the characteristics of a class. Thus, it is also
shown how the super/subclass relationships of the result of a query with its operands
can be established and how the result can be placed persistently in the lattice (schema)
as a class. Such a class is naturally and properly placed in the lattice by maximizing
reusability due to inheritance. Also equivalent object algebra expressions are presented
and the associativity of the cross-product operation which is an important property in
query optimization is proved. Lastly, as it was recognized that schema evolution is an
important requirement to be satisfied by object-oriented databases, hence the handling
of schema evolution functions through the proposed object algebra operations is also
developed as another contribution of the thesis.Al- Hajj, RedaPh.D