Skip to main content
SpringerLink
Log in

Rewriting systems as a tool for relational data base design

  • List Of Contributions
  • Conference paper
  • First Online:
Graph-Grammars and Their Application to Computer Science and Biology (Graph Grammars 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 73))

Abstract

Methodologies for relational data base design have been extensively studied in the literature, mainly with regard to functional dependencies. Rewriting systems may be used as a formal tool to express transformations between refinements of the model in the design process.

In this paper we present a formalism based on hypergraphs and hypergraph grammars to investigate the advantages of a top-down design of a relational data model.

Classes of grammars whose associated languages respect meaningful properties are investigated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ABRIAL J.R.: Data Semantics, Data Base Management, North Holland (1974).

    Google Scholar 

  2. AIELLO CARLUCCI L., MONTANARI U.: Toward a formal definition of the control in Structured Programs. Proc. 2nd Intern. Symp. on Math. Found. of Comp. Science, Springer Verlag (1973).

    Google Scholar 

  3. ARMSTRONG W.W.: Dependency structures of data base relationships. Proc. of IFIP, North Holland (1974).

    Google Scholar 

  4. BATINI C., D'ATRI A.: Un formalismo per il progetto di Basi di Dati relazionali. Proc. of Congresso AICA, (1976).

    Google Scholar 

  5. BATINI C., D'ATRI A.: On the hypergraph model of functional dependencies. Techn.Report, Ist.di Automatica,Università Roma (1978).

    Google Scholar 

  6. CODD E.F.: A Relational model of data for large shared data banks. CACM 13 (1970).

    Google Scholar 

  7. CODD E.F.: A Data Base sublanguage founded on the relational calc u lus. Proc. ACM SIGFIDET Workshop on Data Description, Access and Control (1971).

    Google Scholar 

  8. CODD E.F.: Further normalization of the data base relational model. Data Base Systems, Prentice Hall (1972).

    Google Scholar 

  9. CODD E.F.: Recent investigation in Relational Data Base Systems. Proc. of IFIP, North Holland (1974).

    Google Scholar 

  10. DATE C.J.: An Introduction to Data Base Systems. Addison Wesley (1977).

    Google Scholar 

  11. DELOBEL C., CASEY R.C.: Decomposition of Data Bases and the theory of Boolean Switching Functions. IBM Journal Res.Dev. 17 (1973).

    Google Scholar 

  12. EHRIGH M., KREOWSKY M.: Algebraic Graph Theory Applied in Computer Science. Conference on Algebraic and Categorical Methods in Computer Science and Systems Theory, Hans Ahlenberg, Dortmund (1976).

    Google Scholar 

  13. EHRIGH M., KREOWSKI H.J., MAGGIOLO SCHETTINI A., ROSEN B.K., WINKOWSKI J.: Deriving Structures from Structures. Proc. 7th Intern. Symp. on Math. Found. of Comp. Science, Springer Verlag (1978).

    Google Scholar 

  14. FAGIN R.: The decomposition versus the synthetic approach to Relational Database Design. IBM Journal Res. Dev., (1977).

    Google Scholar 

  15. MONTANARI U.: Separable graphs, planar graphs and web grammars. Information and Control, 16 (1970).

    Google Scholar 

  16. NAGL M.: Formal Languages of labelled graphs. Computing 16 (1976).

    Google Scholar 

  17. PFALZ J.L., ROSENFELD A.: Web Grammars. 1st Int. Joint Conf. on Art. Intelligence, Washington (1969).

    Google Scholar 

  18. RAJLICH V.: Relational Structures and Dynamics of Certain Discrete Systems. Proc. Conf. Math. Found of Comp. Science. High Tatras, Czechoslovakia (1973).

    Google Scholar 

  19. ROSEN B.K.: Deriving Graphs from Graphs by Applying a Production. Acta Informatica, 4 (1975)

    Google Scholar 

  20. ROSENFELD A., MILGRAM D.: Web Automata and Web Grammars. Machine Intelligence, 7 (1972).

    Google Scholar 

  21. RISSANEN J.: Independent Components of Relations. ACM Trans. on Database Systems, 2 (1977).

    Google Scholar 

  22. SHARMAN G.: A constructive definition of third normal form. Proc. ACM SIGMOD Int. Conf. on the Management of Data (1976).

    Google Scholar 

  23. TSICHRITZIS D.: Data Base Management Systems. Academic Press (1977).

    Google Scholar 

  24. WANG C.Q., WEDEKIND M.M.: Segment Synthesis in Logical Data Base Design. IBM Journal Res. Dev. 19 (1976).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto di Automatica, Università di Roma, Via Eudossiana, 18-00184, Roma, Italy

    Carlo Batini & Alessandro D'Atri

Authors
  1. Carlo Batini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alessandro D'Atri
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Volker Claus Hartmut Ehrig Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Batini, C., D'Atri, A. (1979). Rewriting systems as a tool for relational data base design. In: Claus, V., Ehrig, H., Rozenberg, G. (eds) Graph-Grammars and Their Application to Computer Science and Biology. Graph Grammars 1978. Lecture Notes in Computer Science, vol 73. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025717

Download citation

  • DOI: https://doi.org/10.1007/BFb0025717

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09525-5

  • Online ISBN: 978-3-540-35091-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation