Transformations of data base structures

  • A. L. Furtado
List Of Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 73)


Many of the existing data base models have an underlying graph structure. Even certain models based on set theory rather than graph theory are translatable into some graph representation, an important example being the relational model.

Graphs are used to represent the data base at the schema or at the instances level. Also, the representation may refer to conceptual elements, such as entities, attributes, relationships, or to implementational elements, such as files, records, items, links.

In any case, one wishes to characterize the valid configurations, and the allowable operations which transform one configuration into another one. Valid configurations are those that conform to the integrity constraints declared for the particular data base.

In this work we investigate the use of graph grammars for the specification of data base operations, in ways that preserve the imposed integrity constraints.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kerschberg, L., Klug, A. and Tsichritzis, D. — "A taxonomy of data models" — Proc. of the Very Large Data Bases Conference (1976).Google Scholar
  2. 2.
    Reisner, P. — "Use of psychological experimentation as an aid to development of a query language", — IEEE Transactions on Software Engineering, SE-3,3 (1977) 218–229.Google Scholar
  3. 3.
    Zloof, M.M. — "Query by example" — Proc. of National Computer Conference (1975).Google Scholar
  4. 4.
    Mc Donald, N. and Stonebraker, M. — "Cupid: the friendly query language" — Proc. of ACM Pacific Conference (1975).Google Scholar
  5. 5.
    Date, C.J. — "An introduction to data-base systems" — Addison-Wesley (1975).Google Scholar
  6. 6.
    Schneider, H.J. — "Conceptual data base description using graph-grammars" — in "Graphen, Algorithmen, Datenstrukturen" — Noltemeier (ed.) — C. Hanser Verlag (1976).Google Scholar
  7. 7.
    Brainerd, W.S. and Landweber, L.H. — "Theory of Computation" — John Wiley (1974).Google Scholar
  8. 8.
    Montanari, U. — "Separable graphs and web grammars" — Information and Control 16 (1970) 243–267.Google Scholar
  9. 9.
    Furtado, A.L. and Kerschberg, L. — "An algebra of quotient relations" — Proc. of the SIGMOD Conference (1977).Google Scholar
  10. 10.
    Guttag, J.V. and Horowitz, E. — "The design of data type specifications" — in "Current trends in programming methodology" v. IV — Yeh (ed.) — Prentice-Hall (1978).Google Scholar
  11. 11.
    CODASYL Systems Committee — "Feature analysis of generalized data base management systems" — report (1971).Google Scholar
  12. 12.
    Rosenkrantz, D.J. — "Programmed grammars and classes of formal languages" — JACM 16 (1969) 107–131.Google Scholar
  13. 13.
    ANSI/X3/SPARC Study Group — interim report — bulletin FDT of ACM SIGMOD 7,2 (1975).Google Scholar
  14. 14.
    Booth, T.L. — "Sequential machines and automata theory" — John Wiley (1967).Google Scholar
  15. 15.
    Goguen, J.A. et al — "An introduction to categories, algebraic theories and algebras" — IBM report RC 5369 (1975).Google Scholar
  16. 16.
    Paolini, P. and Pelagatti, G. — "Formal definition of mappings in a data base" — Proc. of the SIGMOD Conference (1977).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • A. L. Furtado
    • 1
  1. 1.Departamento de InformáticaPontifícia Universidade Católica do R.J.Brasil

Personalised recommendations