Algorithme de décomposition de clés

E. Pichat

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1985)

  • Volume: 19, Issue: 3, page 213-232
  • ISSN: 0988-3754

How to cite

top

Pichat, E.. "Algorithme de décomposition de clés." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.3 (1985): 213-232. <http://eudml.org/doc/92231>.

@article{Pichat1985,
author = {Pichat, E.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {key decomposition algorithm; contribution graph of a set of functional dependencies; polynomial time complexity; conditional projection},
language = {fre},
number = {3},
pages = {213-232},
publisher = {EDP-Sciences},
title = {Algorithme de décomposition de clés},
url = {http://eudml.org/doc/92231},
volume = {19},
year = {1985},
}

TY - JOUR
AU - Pichat, E.
TI - Algorithme de décomposition de clés
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 3
SP - 213
EP - 232
LA - fre
KW - key decomposition algorithm; contribution graph of a set of functional dependencies; polynomial time complexity; conditional projection
UR - http://eudml.org/doc/92231
ER -

References

top
  1. [1] W. W. ARMSTRONG, Dependency structures of database relationships. Proc. IFIP 1974, North Holland, 1974, 580-583. Zbl0296.68038MR421121
  2. [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. [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. [3] A. BEKESSY, J. DEMETROVICS, Contribution to the theory of database relations. 1979, 1-10. Zbl0399.68029MR534948
  5. [5] P. A. BERNSTEIN, Synthesing third normal form relations from functional dependencies. ACM TODS, 1, 4, Dec. 1976, 277-298. 
  6. [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. Zbl0207.18003
  7. [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. [8] C. DELOBEL, M. ADIBA, Bases de données et systèmes relationnels. Bordas, Paris, 1982. Zbl0573.68057
  9. [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. Zbl0259.68016MR331901
  10. [10] J. DEMETROVICS, On the numberof candidate keys. Information processing letters, 7, 6, 1978, 266-269. Zbl0394.68015MR509425
  11. [11] R. FADOUS, J. FORSYTH, Finding candidate keys for relational data bases. Proc. ACM SIGMOD, 1975, 203-210. 
  12. [12] G. GARDARIN, Bases de données. Eyrolles, Paris, 1983. 
  13. [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. [14] M. LEONARD, Aides algorithmiques à la conception de bases de données. Thèse de 3e cycle, Univ. Grenoble, juin 1976. 
  15. [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. Zbl0457.68099
  16. [16] C. L. LUCCHESI, S. L. OSBORN, Candidate keys for relations. Journal of Computer and System Sciences, 17, 1978, 270-279. Zbl0395.68025MR514276
  17. [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. [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. [19] J. D. ULLMAN, Principles of database systems. Computer Science Press, 1982. Zbl0558.68078MR669881
  20. [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. Zbl0336.68018MR416139
  21. [21] C. ZANIOLO, A new normal form for the design of relational database schema. ACM TODS, 7, 3, Sept. 1982, 489-499. Zbl0488.68061MR677825

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.