Skip to main content
SpringerLink
Log in

An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes

  • Contributed Papers
  • Conference paper
  • First Online:
CAAP'83 (CAAP 1983)

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

Included in the following conference series:

Abstract

An application of the theory of graphs and hypergraphs to the decomposition of Relational Database Schemas is studied.

Four new characterizations of cyclic hypergraphs are given.

Cyclic pairs of nodes are defined and it is proved that their presence characterizes cyclic hypergraphs. An algorithm to detect cyclic pairs is given.

Finally this concept is generalized to cyclic nodes and cyclic sets and it is proved that a hypergraph can be decomposed in a cyclic part and an acyclic part. In this way the acyclic part of a cyclic hypergraph can be isolated.

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.

Bibliography

  1. A. Aho, J. Hopcroft, J. Ullman. The Design and Analysis of Computer Algorithhms., Addison-Wesley, 1974.

    Google Scholar 

  2. C. Berge. Graphes et Hypergraphes, Dunod, Paris, 1970.

    Google Scholar 

  3. C. Beeri, R. Fagin, J. Howard. A Complete Axiomatisation for Functional and Multivalued Dependencies in Database Relations, ACMSIGMOD Intern. Symp. on Manag. of Data, 1977.

    Google Scholar 

  4. C. Beeri, R. Fagin, D. Maier, M. Yannakakis. On the Desirability of Acyclic Database Schemes, IBM, San Jose, RJ3131, 1981.

    Google Scholar 

  5. E. Codd. A Relational Model of Data for Large Shared Data Banks, CACM Vol 13, nr. 6, June 1970, p377–38?.

    Google Scholar 

  6. R. Fagin, A. Mendelzon, J. Ullman. A Simplified Universal Relation. Assumption and its Properties, IBM, San Jose, RJ2900, 1980.

    Google Scholar 

  7. M.H. Graham. On the Universal Relation, Technical Report, University of Toronto, September 1979.

    Google Scholar 

  8. F. Harary. Graph Theory, Addison-Wesley, 1972.

    Google Scholar 

  9. D. Maier, J. Ullman. Connections in Acyclic Hypergraphs, STAN-CS-81-853, 1981.

    Google Scholar 

  10. D. Maier, J. Ullman. Maximal Objects and the Semantics of Universal Relation Databases, SUNY at Stony Brook, 80-016, 1980.

    Google Scholar 

  11. J. Paredaens. The Interaction of Integrity Constraints in an Information System, JCSS, Vol 20, 3, p310–328, 1980.

    Google Scholar 

  12. J. Paredaens, D. Van Gucht. An Application of the Theory of Graphs and Hypergraphs to the Decomposition of Relational Database Schemas, Universitaire Instelling Antwerpen, August 1982.

    Google Scholar 

  13. J. Ullman. Principles of Database Systems, Pitman, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Mathematics, Universitaire Instellin Antwerpen, Universiteitsplein 1, B-2610, Antwerpen, Belgium

    J. Paredaens & D. van Gucht

Authors
  1. J. Paredaens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. van Gucht
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paredaens, J., van Gucht, D. (1983). An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation