Database abstractions
John Miles Smith, Diane C. P. Smith · Communications of the ACM · 1977
Aggregation is introduced as an abstraction which is important in conceptualizing the real world. Aggregation transforms a relationship between objects into a higher-level object. A new data type, called aggregate, is developed which, under certain criteria of “well-definedness,” specifies aggregation abstractions. Relational databases defined as collections of aggregates are structured as a hierarchy of n-ary relations. To maintain well-definedness, update operations on such databases must preserve two invariants. Well-defined relations are distinct from relations in third normal form. It is shown that these notions are complementary and both are important in database design. A top-down methodology for database design is described which separates decisions concerning aggregate structure from decisions concerning key identification. It is suggested that aggregate types, and other types which support real-world abstractions without introducing implementation detail, should be incorporated into programming languages.
Cited by 291 works. doi:10.1145/359605.359620 Open-access PDF
Authors
References
- A relational model of data for large shared data banks
- A relational model of data for large shared data banks
- The programming language pascal
- Further Normalization of the Data Base Relational Model
- Database abstractions
- Programming with abstract data types
- Recent Investigations in Relational Data Base Systems.
- WHAT'S IN A LINK
- Notes on Data Structuring
- On the semantics of the relational data model