Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
Extended semantics for generalization hierarchies
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
On an algebra for historical relational databases: two views
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Compatible attributes in a universal relation
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
A note on decompositions of relational databases
ACM SIGMOD Record
Consistency enforcement in databases
Proceedings of the 2nd international conference on Semantics in databases
| Hi-index | 0.00 |
Standard semantics for the relational model considers domain values to be objects, which assume the roles indicated by the name of its associated attribute. Entities are related to each other to form tuples in a relation; attributes are also interrelated, but in this case the exact relationships have always been left implied or "intuitive." This paper introduces renaming rules, which are a way to formally specify these relationships. Properties of these rules are discussed, and a complete axiomatization is presented.Renaming rules allow meaningful equi-joins to be couched in terms of natural joins. They are intimately associated with the abstraction concept of generalization, and provide a natural semantics and theory for the relational algebraic operatiors select and union. These operators in turn use Smith's subcategory functional dependencies to achieve a better decomposition of a database scheme; to this end, a general normal form algorithm is presented.