Free Access
RAIRO. Inform. théor.
Volume 19, Number 3, 1985
Page(s) 213 - 232
Published online 01 February 2017
  1. W. W. ARMSTRONG, Dependency structures of database relationships. Proc. IFIP 1974, North Holland, 1974, 580-583. [MR: 421121] [Zbl: 0296.68038]
  2. C. BEERI, P. A. BERNSTEIN, Computational problems related to the design of normal form relational schemes. ACM TODS, 4, 1, march 1979, 30-59.
  3. C. BEERI P. A. BERNSTEIN, N. GOODMAN, A sophisticate's introduction to database normalization theory. Proc. 4th Conf. on Very Large Data Bases, West Berlin, ACM, N. Y., 1978, 113-124.
  4. A. BEKESSY, J. DEMETROVICS, Contribution to the theory of database relations. 1979, 1-10. [MR: 534948] [Zbl: 0399.68029]
  5. P. A. BERNSTEIN, Synthesing third normal form relations from functional dependencies. ACM TODS, 1, 4, Dec. 1976, 277-298.
  6. E. F. CODD, A relational model of data for large shared data base banks. Comm. ACM, 13, switching functions. IBM Res. Develop., 17, 1973, 374-386. [Zbl: 0207.18003]
  7. E. F. CODD, Further normalization of the data base relational model. Courant Institute Computer Science Symposie Series, 6 : Data Base Systems, Prentice-Hall, 1971, 33-64.
  8. C. DELOBEL, M. ADIBA, Bases de données et systèmes relationnels. Bordas, Paris, 1982. [Zbl: 0573.68057]
  9. C. DELOBEL, R. G. CASEY, Decomposition of a data base and the theory of Boolean switching functions. IBM Res. Develop, 17, 1973, 374-386. [MR: 331901] [Zbl: 0259.68016]
  10. J. DEMETROVICS, On the numberof candidate keys. Information processing letters, 7, 6, 1978, 266-269. [MR: 509425] [Zbl: 0394.68015]
  11. R. FADOUS, J. FORSYTH, Finding candidate keys for relational data bases. Proc. ACM SIGMOD, 1975, 203-210.
  12. G. GARDARIN, Bases de données. Eyrolles, Paris, 1983.
  13. S. S. ISLOOR, 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. M. LEONARD, Aides algorithmiques à la conception de bases de données. Thèse de 3e cycle, Univ. Grenoble, juin 1976.
  15. T. W. LING, F. W. TOMPA, T. KAMEDA, An improved third normal form for relational databases. Department of Computer Science, University of Waterloo, Ontario, Canada, Research report, 1979, 15 p. [Zbl: 0457.68099]
  16. C. L. LUCCHESI, S. L. OSBORN, Candidate keys for relations. Journal of Computer and System Sciences, 17, 1978, 270-279. [MR: 514276] [Zbl: 0395.68025]
  17. E. PICHAT, 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. E. PICHAT, C. DELOBEL, Designing nonredundant third normal form relational database schema. Rapport de recherche n° 149, IMGA, Université de Grenoble, janvier 1979, 39 p.
  19. J. D. ULLMAN, Principles of database systems. Computer Science Press, 1982. [MR: 669881] [Zbl: 0558.68078]
  20. C. T. YU, D. T. JOHNSON, 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. [MR: 416139] [Zbl: 0336.68018]
  21. C. ZANIOLO, A new normal form for the design of relational database schema. ACM TODS, 7, 3, Sept. 1982, 489-499. [MR: 677825] [Zbl: 0488.68061]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.