ACM Home Page
Please provide us with feedback. Feedback
Database abstractions: aggregation and generalization
Full text PdfPdf (2.02 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 2 ,  Issue 2  (June 1977) table of contents
Pages: 105 - 133  
Year of Publication: 1977
ISSN:0362-5915
Authors
John Miles Smith  Univ. of Utah, Salt Lake City
Diane C. P. Smith  Univ. of Utah, Salt Lake City
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 212,   Citation Count: 309
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/320544.320546
What is a DOI?

ABSTRACT

Two kinds of abstraction that are fundamentally important in database design and usage are defined. Aggregation is an abstraction which turns a relationship between objects into an aggregate object. Generalization is an abstraction which turns a class of objects into a generic object. It is suggested that all objects (individual, aggregate, generic) should be given uniform treatment in models of the real world. A new data type, called generic, is developed as a primitive for defining such models. Models defined with this primitive are structured as a set of aggregation hierarchies intersecting with a set of generalization hierarchies. Abstract objects occur at the points of intersection. This high level structure provides a discipline for the organization of relational databases. In particular this discipline allows: (i) an important class of views to be integrated and maintained; (ii) stability of data and programs under certain evolutionary changes; (iii) easier understanding of complex models and more natural query formulation; (iv) a more systematic approach to database design; (v) more optimization to be performed at lower implementation levels. The generic type is formalized by a set of invariant properties. These properties should be satisfied by all relations in a database if abstractions are to be preserved. A triggering mechanism for automatically maintaining these invariants during update operations is proposed. A simple mapping of aggregation/generalization hierarchies onto owner-coupled set structures is given.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
CODD, E.F. Further normalization of the data base relational model. In Courant Computer Science Symposium 6: Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., May 1971, pp. 33-64.
 
2
HOAttE, C.A.R. Notes on data structuring. In A PIC Studies in Data Processing No. 8: Structured Programming, Academic Press, New York, 1972, pp. 83-174.
 
3
QUILbI~N, M.R. Semantic memory. In Semantic Information Processing, M.I.T. Press, Cambridge, Mass., 1968, pp. 227-268.
4

CITED BY  309

Collaborative Colleagues:
John Miles Smith: colleagues
Diane C. P. Smith: colleagues