Skip to main content

A relational algebra for complex objects based on partial information

  • Complex Objects
  • Conference paper
  • First Online:
MFDBS 91 (MFDBS 1991)

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

Included in the following conference series:

Abstract

We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain — a partially ordered space of descriptions. This approach permits generalizations of relations that admit null values and variants. In previous work it was shown how to define the notion of a relation scheme in such a setting. Here we provide a characterization of a scheme that is more general, and show that operations analogous to projection, selection and join retain the desired properties. Schemes also allow us to develop dependency theory for such generalized relations. An extension of this model is described which admits a set constructor and is therefore useful for the study of higher-order relations and their generalizations.

Supported in part by NSF Grants IRI-86-10617 and CCR-90-57570 and ONR Grant NOOO14-88-K0634

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bancilhon, S. Khoshafin. A calculus for complex objects. In PODS 1986.

    Google Scholar 

  2. C. Beeri. Formal models for object oriented databases. In: Proc. of Int. Conf. on Deductive and Object-Oriented Databases, Kyoto, December 1989.

    Google Scholar 

  3. G. Birkhoff. Lattice Theory. 3rd ed., AMS, Providence, RI, 1967.

    Google Scholar 

  4. J. Biskup. A formal approach to null values in database relations. In: Advances in Database Theory (H. Gallaire, J. Minker, J.M. Nicolas, Eds.), Plenum Press, New York, 1981, pp.299–341.

    Google Scholar 

  5. P. Buneman, A. Jung, A. Ohori. Using powerdomains to generalize relational databases. Theoretical Computer Science, 1991, to appear.

    Google Scholar 

  6. L.S. Colby. A recursive algebra and query optimization for nested relations. In SIGMOD 89.

    Google Scholar 

  7. J.-Y. Girard. The system F of variable types: fifteen years later. Theoretical Computer Science 45:159–192, 1986.

    Google Scholar 

  8. C. Gunter, D. Scott. Semantic domains. In “Handbook on Theoretical Computer Science”, J. van Leeuwen, ed., North Holland, 1990, pp. 633–674.

    Google Scholar 

  9. M. Gyssens, J. Paredaens, D. Van Gucht. A grammar-based approach towards unifying hierarchical databases. In SIGMOD 89.

    Google Scholar 

  10. T. Imielinski, W. Lipski. Incomplete information in relational databases. J. of ACM 31(4):761–791, 1984.

    Google Scholar 

  11. A. Jung. Personal communication. June 1990.

    Google Scholar 

  12. A. Jung, L. Libkin, H. Puhlmann. Decomposition of domains. In Proc. of the Conf. on Math. Foundations of Programming Semantics — 91, to appear. Available as Technical Report MS-CIS-90-84, University of Pennsylvania, 1990.

    Google Scholar 

  13. Nested relations and Complex Objects in Databases (S.Abiteboul, P.Fischer and H.-J.Schek eds.) Springer LNCS, Vol. 361, 1989.

    Google Scholar 

  14. A. Ohori. A study on semantics, types and languages for databases and object-oriented programming. PhD Thesis, University of Pennsylvania, 1989.

    Google Scholar 

  15. A. Ohori. Semantics of types for database objects. 2nd International Conference on Database Theory, 1988.

    Google Scholar 

  16. J. Paredaens, P. De Bra, M. Gyssens, D. Van Gucht. The Structure of the Relational Datamodel. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  17. M.A. Roth, H.F. Korth, A. Silberschatz. Extended algebra and calculus for nested relational databases. ACM TODS, 13(4):389–417, 1988.

    Google Scholar 

  18. M.A. Roth, H.F. Korth, A. Silberschatz. Null values in nested relational databases. Acta Informatica, 26(7):615–642, 1989.

    Google Scholar 

  19. V.N. Salii. Lattices with Unique Complements. AMS, Providence, RI, 1988.

    Google Scholar 

  20. H.-J. Schek, M. Scholl. The relational model with relation-valued attributes. Inform. Systems, 11(2):137–147, 1986.

    Google Scholar 

  21. D.S. Scott. Domains for denotational semantics. In ICALP, July 1982.

    Google Scholar 

  22. M.B. Smyth. Power domains. Journal of Computer and System Sciences 16(1):23–36, 1978.

    Article  Google Scholar 

  23. K. Tanaka, T.-S. Chang. On natural join in object-oriented databases. In: Proc. of Int. Conf. on Deductive and Object-Oriented Databases, Kyoto, December 1989.

    Google Scholar 

  24. J.D. Ullman. Principles of Database Systems. Pittman, 2nd ed., 1982.

    Google Scholar 

  25. C. Zaniolo. Database relations with null values. Journal of Computer and System Sciences 28(1):142–166, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bernhard Thalheim János Demetrovics H. -D. Gerhardt

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Libkin, L. (1991). A relational algebra for complex objects based on partial information. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-54009-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54009-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics