Voir la notice de l'article provenant de la source Numdam
@article{ITA_1983__17_2_97_0,
author = {Batini, C. and d'Atri, A.},
title = {Relational data base design using refinement rules},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {97--119},
publisher = {EDP-Sciences},
volume = {17},
number = {2},
year = {1983},
mrnumber = {713224},
zbl = {0519.68083},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ITA_1983__17_2_97_0/}
}
TY - JOUR AU - Batini, C. AU - d'Atri, A. TI - Relational data base design using refinement rules JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1983 SP - 97 EP - 119 VL - 17 IS - 2 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/item/ITA_1983__17_2_97_0/ LA - en ID - ITA_1983__17_2_97_0 ER -
%0 Journal Article %A Batini, C. %A d'Atri, A. %T Relational data base design using refinement rules %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1983 %P 97-119 %V 17 %N 2 %I EDP-Sciences %U http://geodesic.mathdoc.fr/item/ITA_1983__17_2_97_0/ %G en %F ITA_1983__17_2_97_0
Batini, C.; d'Atri, A. Relational data base design using refinement rules. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983) no. 2, pp. 97-119. http://geodesic.mathdoc.fr/item/ITA_1983__17_2_97_0/
1., Dependency Structures of Data Base Relationships, Proc. IFIP 74, 1974, pp. 580-583. | Zbl | MR
2., and ; Transitive Closure and Other Graph Algorithms for the Synthesis and Manipulation of Data Base Schemas, Graph theoretic Concepts in Computer Science, L.N.C.S., Vol. 100, 1981, pp. 212-223. | Zbl | MR
3. and , Rewriting Systems as a Tool for Relational Data Base Design, Graph Grammars and their applications to Computer Science and Biology, L.N.C.S., Vol. 73, 1978 pp. 139-154. | Zbl | MR
4. and , Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design, Graph Theoretic concepts in Computer Science, L.N.C.S., Vol. 100, 1981, pp. 177-194. | Zbl | MR
5., and , A Sophisticate Introduction to Data Base Normalization Theory, Proc. 4th Int. Conf. on Very Large Data Bases, 1978, pp. 113-124.
6. , Synthesizing Third Normal Form Relations from Functional Dependencies, A.C.M. Trans. on Data Base Systems, Vol. 4, 1976, pp. 277-298.
7. , A Relational Model for Large Shared Data Banks, Com. A.C.M., Vol. 13, 1970, pp. 377-387. | Zbl
8. , Further Normalization of the Data Base Relational Model, in Data Base Systems, R. RUSTIN, Ed. Prentice Hall, 1972, pp. 33-64.
9. , Introduction to Data Base Systems, Addison Wesley, 1977. | Zbl
10. , , and , Use of Bipartite Graphs as a Notation for Data Base, Information Systems, Vol. 4, 1979, pp. 137-141. | Zbl
11. , and , On Findingthe the Optimal Access Path to Resolve a Relational Data Base Query, MFSC'80, L.N.C.S., Vol. 88, 1980, pp. 219-230. | Zbl
12. and , Algebraic Theory of Graph Grammars Applied to Consistency and Synchronization in Data Bases, Proc. Workshop WG79 on Graphtheoretic Concepts in Computer Science, 1979. | MR | Zbl
13. , Multivalued Dependencies and a New Normal Form for Relational Data Bases, A.C.M. Trans. on Data Base Systems, 3, 1977, pp. 262-278.
14. , The Decomposition Versus the Synthetic Approach to Relational Data Base Design, I.B.M. Journal Res. Dev., 1977.
15. , Transformation of Data Base Structures, Graph Grammars and their Application to Computer Science and Biology, L.N.C.S., Vol. 73, 1978, pp. 224-236. | Zbl
16. , Some Analytic Tools for the Design of Relational Data Bases, Proc. 6th Conf. on Very Large Data Bases, 1980, pp. 417-428.
17. et al., 1978 New Orleans Data Base Design Workshop Report, I.B.M. Report RJ 2554, 1979.
18. , Independent Components of Relations, A.C.M. Trans. on Data Base Systems 2, Vol. 4, 1977, pp. 317-325.
19. , Definitional Mechanism of Conceptual Grap Graph Grammars and their applications to Computer Science and Biology, L.N.C.S., Vol. 73, 1978, pp. 426-439. | Zbl | MR