Abstract
In this paper we apply the formalism of hypergraphs and hypergraph context free grammars to characterize and investigate various aspects of logical data base design.
We show that the hypergraph formalism is a uniform notation to represent data and properties of data. Several results concerning context free generation of conceptual schemata are proved.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
ARMSTRONG, W.W.:"Dependency structures of Database Relationships," proc. IFIP74, North Holland 1974.
BATINI C. and D'ATRI A.:"Rewriting Systems as a tool for Relational Data Base Design" — Proc. Int.Work. on Graph Grammars and their applications to Biology and Computer Science — Lecture Notes in Computer Science, Springer-Verlag 1979.
BATINI C. and D'ATRI A.:"On the hypergraph model of functional dependencies." R79-01, Istituto di Automatica — Roma — Italy
BATINI C. and D'ATRI A.:"Schema Hypergraphs: A formalisms to investigate Logical Data Base Design — Extended version." Tecnical Report — Istituto di Automatica — Roma (1980).
BEERI C., BERNSTEIN P.A., GOODMAN N.:"A Sophisticate Introduction to Data Base Normalization Theory." Proc. Conf. on Very Large Data Dases— Berlin 1978.
DATE C.J.: An Introduction to Data Base Systems-Addison Wesley 2nd edition 1978.
1978 New Orleans data base design Workshop Report. IBM Report RJ2554 (33154)7/13/79.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Batini, C., D'Atri, A. (1981). Schema hypergraphs:A formalism to investigate logical data base design. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-10291-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10291-5
Online ISBN: 978-3-540-38435-9
eBook Packages: Springer Book Archive