Abstract
Since Codd introduced the relational database model and functional dependencies [Codd 1970], the semantics of relationships between the attributes of a database has been extensively studied by many computer scientists. In this chapter we introduce an application of the calculus of binary relations to the (n-ary) relational database model. This consists of using the notion of difunctional relations to define difunctional dependencies in the relational database model. Difunctional dependencies are weaker than functional dependencies, but more regular than the other well-known dependencies.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Wien
About this chapter
Cite this chapter
Jaoua, A., Belkhiter, N., Ounalli, H., Moukam, T. (1997). Databases. In: Brink, C., Kahl, W., Schmidt, G. (eds) Relational Methods in Computer Science. Advances in Computing Sciences. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6510-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6510-2_13
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82971-4
Online ISBN: 978-3-7091-6510-2
eBook Packages: Springer Book Archive