[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

A universal relation model for nested relations

  • Complex Database Objects
  • Conference paper
  • First Online:
Advances in Database Technology—EDBT '88 (EDBT 1988)

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

Included in the following conference series:

Abstract

The Universal Relation (UR) model has been researched with the ultimate objective to free the user from logical navigation in a relational database. There have been many different suggestions as to how to implement a UR interface. Nested relations have been recently suggested as a way of extending the applicability of the classical relational model. In this paper we establish a strong connection between the UR model and nested relations. Thus, nested relations are shown to be a suitable internal level for implementing efficiently a UR interface.

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.

Similar content being viewed by others

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. ATZENI P., AND PARKER Jr. D. S. 1982. Assumptions in relational database theory. Proc. ACM PODS, pp. 1–9.

    Google Scholar 

  3. BISKUP J., AND BRÜGGEMANN H. H. 1983. Universal relation views: A pragmatic approach. Proc. VLDB, pp. 172–185.

    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.

    Article  Google Scholar 

  6. CODD E. F. 1979. Extending the database relational model to capture more meaning. ACM TODS 4, pp. 397–434.

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. DESAI B. C., GOYAL P., AND SADRI F. 1987. Non-first normal form universal relations: An application to information retrieval systems. Information Systems 12, pp. 49–55.

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  11. 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 

  12. FAGIN R., AND VARDI M. Y. 1984. The theory of data dependencies — A survey. IBM Research Report RJ4321 (47149), San Jose, CA.

    Google Scholar 

  13. 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 

  14. HONEYMAN P. 1982. Testing satisfaction of functional dependencies. JACM 29, pp. 668–677.

    Google Scholar 

  15. KENT W. 1981. Consequences of assuming a universal relation. ACM TODS 6, pp. 539–556.

    Google Scholar 

  16. KORTH H. F., KUPER G. M., FIEGENBAUM J., VAN GELDER A., AND ULLMAN J. D. 1984. System/U — A database system based on the universal relation assumption. ACM TODS 9, pp. 331–347.

    Google Scholar 

  17. KUCK S. M., AND SAGIV Y. 1982. A universal relation database system implemented via the network model. Proc. ACM PODS, pp. 147–157.

    Google Scholar 

  18. LIEN Y. E. 1979. Multivalued dependencies with null values in relational databases. Proc. VLDB. pp. 61–66.

    Google Scholar 

  19. 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 

  20. LEVENE M., AND LOIZOU G. 1987. A universal relation interface incorporating nested relations. Submitted for publication.

    Google Scholar 

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

    Google Scholar 

  22. MAIER D., MENDELZON A. O., AND SAGIV Y. 1979. Testing implications of data dependencies. ACM TODS 4, pp. 455–469.

    Google Scholar 

  23. MAIER D., ROZENSHTEIN D., SALVETER S., STEIN J., AND WARREN D. S. 1987. PIQUE: A relational query language without relations. Information Systems 12, pp. 317–335.

    Google Scholar 

  24. MAIER D., ROZENSHTEIN D., AND WARREN D. S. 1983. Windows on the world. Proc. ACM SIGMOD, pp. 68–78.

    Google Scholar 

  25. 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 

  26. MAIER D., AND WARREN D. S. 1982. Specifying connections for a universal relation scheme database. Proc. ACM SIGMOD, pp. 1–7.

    Google Scholar 

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

    Google Scholar 

  28. OZSOYOGLU Z. M., AND YUAN L.-Y. 1987. A design method for nested relational databases. Proc. 3rd IEEE Conf. on Data Engineering.

    Google Scholar 

  29. 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, U.S.A.

    Google Scholar 

  30. SAGIV Y. 1983. A characterization of globally consistent databases and their correct access paths. ACM TODS 8, pp. 266–286.

    Google Scholar 

  31. STEIN J., AND MAIER D. 1985. Relaxing the universal relation scheme assumption. Proc. ACM PODS, pp. 76–84.

    Google Scholar 

  32. THOMAS S. J., AND FISCHER P. C. 1986. Nested relational structures. Advances in Computing Research 3, JAI Press, pp. 269–307.

    Google Scholar 

  33. ULLMAN J. D. 1982. The U.R. strikes back. Proc. ACM PODS, pp. 10–22.

    Google Scholar 

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

    Google Scholar 

  35. ULLMAN J. D. 1983. Universal relation interfaces for database systems. Proc. IFIP, Mason R.E.A. (ed.), North-Holland, pp. 243–252.

    Google Scholar 

  36. VAN GUCHT D., AND FISCHER P. C. 1986. Some classes of multilevel relational structures. Proc. ACM PODS, pp. 60–69.

    Google Scholar 

  37. ZANIOLO C. 1984. Database relations with null values. JCSS 28, pp. 142–166.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Birkbeck College, University of London, Malet Street, WC1E 7HX, London, UK

    M. Levene & G. Loizou

Authors
  1. M. Levene
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Loizou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. W. Schmidt S. Ceri M. Missikoff

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levene, M., Loizou, G. (1988). A universal relation model for nested relations. In: Schmidt, J.W., Ceri, S., Missikoff, M. (eds) Advances in Database Technology—EDBT '88. EDBT 1988. Lecture Notes in Computer Science, vol 303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19074-0_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-19074-0_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39095-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation