Closure Maintenance in An Object-Oriented Query Model.
Reda Alhajj, Faruk Polat:
Closure Maintenance in An Object-Oriented Query Model.
CIKM 1994: 72-79@inproceedings{DBLP:conf/cikm/AlhajjP94,
author = {Reda Alhajj and
Faruk Polat},
title = {Closure Maintenance in An Object-Oriented Query Model},
booktitle = {Proceedings of the Third International Conference on Information
and Knowledge Management (CIKM'94), Gaithersburg, Maryland, November
29 - December 2, 1994},
publisher = {ACM},
year = {1994},
pages = {72-79},
ee = {db/conf/cikm/AlhajjP94.html, http://doi.acm.org/10.1145/191246.191262},
crossref = {DBLP:conf/cikm/94},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
An object-algebra is presented as a formal query model for object-oriented data models. The
algebra serves not only to access and manipulate the structure and behavior of objects, but it also
supports the creation of new objects and the introduction of new relationships into the schema. It
provides a more powerful and flexible tool than messages for effectively dealing with complex
situations and meeting associative access requirements. Operands as well as the results of
operations in the proposed algebra are formally characterized as a pair of sets--a set of objects
capturing the states and a set of message expressions comprised of sequences of messages
modeling the object behavior. The closure property is achieved in a natural way by letting the results
of operations possess the same characteristics as the operands in an algebra expression. Some
operators of the algebra resemble those of the relational algebra but with different syntax and
semantics. Additional operators are introduced to complement them. A class is shown to posses the
properties of an operand by defining a set of objects and deriving a set of message expressions for it.
Furthermore, the result of an object algebra expression is shown to have the characteristics of a class
whose superclass/subclass relationships with its operand class(es) can be established providing a
mechanism to properly and persistently place it in the class lattice (schema).
Copyright © 1994 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 2 Issue 4, CIKM, DOLAP, GIS, SIGFIDET, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Proceedings of the Third International Conference on Information and Knowledge Management (CIKM'94), Gaithersburg, Maryland, November 29 - December 2, 1994.
ACM 1994
Contents BibTeX
Online Edition
Citation Page
BibTeX
Referenced by
- Reda Alhajj:
Documenting Legacy Relational Databases.
ER (Workshops) 1999: 161-172
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
CIKM 1994 Proceedings, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:01:44 2009