Utilisateur:Carlaairine/Brouillon
- → N'hésitez pas à publier sur le brouillon un texte inachevé et à le modifier autant que vous le souhaitez.
- → Pour enregistrer vos modifications au brouillon, il est nécessaire de cliquer sur le bouton bleu : « Publier les modifications ». Il n'y a pas d'enregistrement automatique.
Si votre but est de publier un nouvel article, votre brouillon doit respecter les points suivants :
- Respectez le droit d'auteur en créant un texte spécialement pour Wikipédia en français (pas de copier-coller venu d'ailleurs).
- Indiquez les éléments démontrant la notoriété du sujet (aide).
- Liez chaque fait présenté à une source de qualité (quelles sources – comment les insérer).
- Utilisez un ton neutre, qui ne soit ni orienté ni publicitaire (aide).
- Veillez également à structurer votre article, de manière à ce qu'il soit conforme aux autres pages de l'encyclopédie (structurer – mettre en page).
- → Si ces points sont respectés, pour transformer votre brouillon en article, utilisez le bouton « publier le brouillon » en haut à droite. Votre brouillon sera alors transféré dans l'espace encyclopédique.
Context
[modifier | modifier le code]One of the issues encountered during the design of a relational database, is the representation of the relationships between the data under consideration. This representation might allow to correctly describe the reality of the application that is being studied. These relationships require that certain data verify a set of constraints, also called dependencies. ( Dependency theory )
Definition[1] : For any given application, only a subset of all possible relations is of interest. This subset is defined by constraints that are to be satisfied by the relations of interest. A class of constraints that has been extensively studied is the class of dependencies.
Dependency classes
[modifier | modifier le code]There are different classes of dependencies, among which there are:
FD | functional dependencies[2] |
JD | join dependencies[3] [4] [5] |
MVD | multivalued dependencies[6] [7] [1] |
TGD | tuple-generating dependencies[1] |
EGD | equality-generating dependencies[1] |
TTGD | total tuple-generating dependencies[1] |
EMVD | embedded multivalues dependencies[6] |
EID | embededd implicational dependencies[8] |
AD | algebraic dependencies [9] |
The MVDs were introduced before the appearance of several other classes such as JD :
In general, a jd may involve more than two attribute sets. Multivalued dependency (mvd) is the special case of jd’s that have at most two attribute sets. Due to their naturalness, mvd’s were intro-duced before jd’s and have several interesting properties, which makes them worth studying on their own.[5]
Classification
[modifier | modifier le code]The classification of these different classes can be illustrated by this diagram, which provides a summarization of the following elements provided by Catriel BEERI et Moshe Y. Vardi [1] :
- EGD (Equality-generating dependencies) generalize FDs (functional dependencies).
- TTGD (Total tuple-generating dependencies) generalize MVDs.
- The class of TTGDs and EGDs contains as special cases almost all classes of dependencies that were investigated in the literature, for example, functional (FD), multivalued (MVD), join (JD), and transitive dependencies. It is equivalent to the class of generalized dependencies of Grant and Jacobs[10]. (...) It does not include, however, the classes of embedded multivalued dependencies (EMVD)[6] and embedded join dependencies[11].
- Tuple-generating dependencies (TGD) generalize TTGDs and EMVDs.
- The class of TGDs and EGDs is equivalent to Fagin's class of embedded implicational dependencies (EID) [8], and is also shown in [9] to be equivalent to the class of algebraic dependencies (AD).
Limitations of the study
[modifier | modifier le code]This study does not include an exhaustive list of dependencies, in particular it does not involve the classes of embedded join dependencies[11] and inclusion dependencies.[12]
References
[modifier | modifier le code]- Catriel Beeri, Moshe Y. Vardi: A Proof Procedure for Data Dependencies. J. ACM 31(4): 718-741 (1984)
- CODD, E.F. Further normalization of the data base relational model. In Data Base Systems (R. Rustin, Ed.). Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 33-64.
- AnD, A. g., BEERI, C., AND ULLMAN, J.D. The theory of joins in relational databases. ACM Trans DatabaseSyst 4, 3 (Sept. 1979), 297-314.
- RISSANEN, J. Theory of relations for databases--A tutorial survey. In Proceedings of the 7th Symposium on Mathematzcal Foundattons of Computer Science (Zakopane, Poland, Sept. 4-8) Lecture Notes in Computer Science, vol. 64. Springer-Verlag, New York, 1978, pp. 537-551.
- Serge Abiteboul, Richard Hull, Victor Vianu: Foundations of Databases. Addison-Wesley 1995, (ISBN 0-201-53771-0) (Chapter 8)
- FAGIN,R. Multivalueddependeneiesandanewnormalformforrelationaldatabases.ACMTrans. Database Syst 2, 2 (June 1977), 262-278.
- ZANIOLO,C. Analysis and design of relational schemata for database systems. Tech. Rep. UCLA-ENG-7769, Dept. Computer Science, UCLA, Los Angeles, July 1976.
- FAGIN, R. Horn clauses and database dependencies. £ ACM29, 4 (Oct. 1982), 952-985.
- YANNAKAKIS, M., AND PAPDIMITRIOU, C. Algebraic dependencies. J. Comput. System Sci. 21 (1982), 2--41.
- GRANT, J., AND JACOeS, B.E. On the family of generalized dependency constraints. 3. ACM 29, 2 (Oct. 1982), 986-997.
- MATER, D., MENOELZON, A. O., AND SAGIV, Y. Testing implications of data dependencies. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 455-469.
- FAGIN, R. A normal form for relational databases that is based on domains and keys. ACM Trans. DatabaseSyst. 6, 3 (Sept. 1981), 387-415.