Skip to main content

γ-Acyclic database schemes and nested relations

  • Part IV Database Design
  • Conference paper
  • First Online:

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

Abstract

Nested relations have been put forward as a way of extending the applicability of the classical relational model. In this model acyclic database schemes have attracted a lot of interest because of the desirable properties they enjoy. Herein we characterize those γ-acyclic database schemes that are equivalent to nested relation schemes, and present an algorithm to restructure a γ-acyclic database scheme into a nested database scheme. This is desirable, since nested relations minimize redundancy and improve efficiency.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ABITEBOUL S., and BIDOIT N. 1986. Non first normal form relations: an algebra allowing data restructuring. JCSS 33, pp. 361–393.

    Google Scholar 

  2. BACHMAN C. W. 1969. Data structure diagrams. Data Base 1, pp. 4–10.

    Google Scholar 

  3. BERGE C. 1973. Graphs and Hypergraphs. Amsterdam, North-Holland.

    Google Scholar 

  4. BISKUP J., BRÜGGEMANN H. H., SCHNETGÖKE L., AND KRAMER M. 1986. One flavor assumption and γ-acyclicity for universal relation views. Proc. ACM PODS, pp. 148–159.

    Google Scholar 

  5. BEERI C., FAGIN R., MAIER D., and YANNAKAKIS M. 1983. On the desirability of acyclic database schemes. JACM 30, pp. 479–513.

    Google Scholar 

  6. BEERI C., and VARDI M. Y. 1981. On the properties of join dependencies. In Advances in Databases Vol. 1 (Gallaire H., Minker J., and Nicholas J. M. Eds.). New York, Plenum Press, pp. 25–72.

    Google Scholar 

  7. DELOBEL C. 1978. Normalization and hierarchical dependencies in the relational data model. ACM TODS 3, pp. 201–222.

    Google Scholar 

  8. FAGIN R. 1977. Multivalued dependencies and a new normal form for relational databases. ACM TODS 2, pp. 262–278.

    Google Scholar 

  9. FAGIN R. 1983. Degrees of acyclicity for hypergraphs and relational database systems. JACM 30, pp. 514–550.

    Google Scholar 

  10. FAGIN R., MENDELZON A. O., and ULLMAN J. D. 1982. A simplified universal relation assumption and its properties. ACM TODS 7, pp. 343–360.

    Google Scholar 

  11. FAGIN R., AND VARDI M. Y. 1984. The theory of data dependencies — A survey. IBM research report RJ 4321 (47149), San Jose, CA.

    Google Scholar 

  12. FISCHER P. C., SAXTON L. V., THOMAS S. J., and van GUCHT D. 1985. Interactions between dependencies and nested relational structures. JCSS 31, pp. 343–354.

    Google Scholar 

  13. GRAHNE G., AND RÄIHÄ K.-J. 1984. Dependency characterizations for acyclic database schemes. Proc. ACM PODS, pp. 9–18.

    Google Scholar 

  14. JAJODIA S. (1985). On the equivalence of relational and network database models. Information Processing Letters 20, pp. 51–54.

    Google Scholar 

  15. LIEN Y. E. 1982. On the equivalence of database models. JACM 29, pp. 333–362.

    Google Scholar 

  16. LEVENE M., AND LOIZOU G. 1987. Project-join constructibility for NF2 relational databases. Bases De Données Advancées, BD3, pp. 143–163.

    Google Scholar 

  17. LEVENE M., AND LOIZOU G. 1987. An optimized fourth normal form utilizing nested relations. Research Report LL-87-01, Department of Computer Science, Birkbeck College, University of London, UK.

    Google Scholar 

  18. LEVENE M., AND LOIZOU G. 1988. A universal relation model for nested relations. Proceedings of International Conference on Extending Database Technology, Venice, pp. 294–308.

    Google Scholar 

  19. MAIER D. 1983. The Theory of Relational Databases. Rockville, Maryland, Computer Science Press.

    Google Scholar 

  20. MAIER D., ULLMAN J. D., and VARDI M. Y. 1984. On the foundations of the universal relation model. ACM TODS 9, pp. 283–308.

    Google Scholar 

  21. OZSOYOGLU Z. M., and YUAN L.-Y. 1987. A new normal form for nested relations. ACM TODS 12, pp. 111–136.

    Google Scholar 

  22. OZSOYOGLU Z. M., AND YUAN L.-Y. 1987. A design method for nested relational databases. Proc. 3rd IEEE Conference on Data Engineering, pp. 599–608.

    Google Scholar 

  23. ROTH M. A., KORTH H. F., AND SILBERSCHATZ A. 1985. Null values in — 1NF relational databases. Research report TR-85-32, Department of Computer Science, University of Texas at Austin, USA.

    Google Scholar 

  24. ULLMAN J. D. 1983. Principles of Database Systems. Rockville, Maryland, Computer Science Press.

    Google Scholar 

  25. van GUCHT D., and FISCHER P. C. 1988. Multilevel nested relational structures. JCSS 36, pp. 77–105.

    Google Scholar 

  26. YANNAKAKIS M. 1981. Algorithms for acyclic database schemes. Proc. VLDB, pp. 82–94.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

S. Abiteboul P. C. Fischer H. -J. Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levene, M., Loizou, G. (1989). γ-Acyclic database schemes and nested relations. In: Abiteboul, S., Fischer, P.C., Schek, H.J. (eds) Nested Relations and Complex Objects in Databases. NF2 1987. Lecture Notes in Computer Science, vol 361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51171-7_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-51171-7_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46175-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics