@article{ITA_1985__19_3_213_0,
author = {Pichat, E.},
title = {Algorithme de d\'ecomposition de cl\'es},
journal = {RAIRO. Informatique th\'eorique},
pages = {213--232},
year = {1985},
publisher = {EDP Sciences},
volume = {19},
number = {3},
mrnumber = {809757},
zbl = {0568.68075},
language = {fr},
url = {https://www.numdam.org/item/ITA_1985__19_3_213_0/}
}
Pichat, E. Algorithme de décomposition de clés. RAIRO. Informatique théorique, Tome 19 (1985) no. 3, pp. 213-232. https://www.numdam.org/item/ITA_1985__19_3_213_0/
[1] , Dependency structures of database relationships. Proc. IFIP 1974, North Holland, 1974, 580-583. | Zbl | MR
[2] , , Computational problems related to the design of normal form relational schemes. ACM TODS, 4, 1, march 1979, 30-59.
[3] , , A sophisticate's introduction to database normalization theory. Proc. 4th Conf. on Very Large Data Bases, West Berlin, ACM, N. Y., 1978, 113-124.
[3] , , Contribution to the theory of database relations. 1979, 1-10. | Zbl | MR
[5] , Synthesing third normal form relations from functional dependencies. ACM TODS, 1, 4, Dec. 1976, 277-298.
[6] , A relational model of data for large shared data base banks. Comm. ACM, 13, switching functions. IBM Res. Develop., 17, 1973, 374-386. | Zbl
[7] , Further normalization of the data base relational model. Courant Institute Computer Science Symposie Series, 6 : Data Base Systems, Prentice-Hall, 1971, 33-64.
[8] , , Bases de données et systèmes relationnels. Bordas, Paris, 1982. | Zbl
[9] , , Decomposition of a data base and the theory of Boolean switching functions. IBM Res. Develop, 17, 1973, 374-386. | Zbl | MR
[10] , On the numberof candidate keys. Information processing letters, 7, 6, 1978, 266-269. | Zbl | MR
[11] , , Finding candidate keys for relational data bases. Proc. ACM SIGMOD, 1975, 203-210.
[12] , Bases de données. Eyrolles, Paris, 1983.
[13] , An algorithm with logical simplicity for designing third normal form relational database schema from functional dependencies. ICMOD 78, 29-30 June 1978, FAST, Milano, Italy, 31-50.
[14] , Aides algorithmiques à la conception de bases de données. Thèse de 3e cycle, Univ. Grenoble, juin 1976.
[15] , , , An improved third normal form for relational databases. Department of Computer Science, University of Waterloo, Ontario, Canada, Research report, 1979, 15 p.
[16] , , Candidate keys for relations. Journal of Computer and System Sciences, 17, 1978, 270-279. | Zbl | MR
[17] , Algorithme construisant une base de données sous 3e forme normale irredondante ou la réconciliation des algorithmes de synthèse et de décomposition.Actes des Journées d'études ADI « Bases de données », Toulouse, nov. 1983, 139-156.
[18] , , Designing nonredundant third normal form relational database schema. Rapport de recherche n° 149, IMGA, Université de Grenoble, janvier 1979, 39 p.
[19] , Principles of database systems. Computer Science Press, 1982. | Zbl | MR
[20] , , On the complexity of finding the set of candidate keys for a given set of functional dependencies. Information Processing letters, 5, 4, October 1976, 100-101. | Zbl | MR
[21] , A new normal form for the design of relational database schema. ACM TODS, 7, 3, Sept. 1982, 489-499. | Zbl | MR






