Skip to main content

Categorical models of relational databases I: Fibrational formulation, schema integration

  • Conference paper
  • First Online:

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

Abstract

This paper uses category theory to provide a formal mathematical framework for specifying and integrating relational database schemas; it builds on the work of Buneman et al. [2], who develop a domain-theoretic version of relational database theory. We generalize their setting in the following way: we let a schema be a functor V from a category L of attribute names to the category of domains; this reflects the fact that attributes may take values of different types, and that there may be functional constraints between attributes. As an application, we show how the process of schema integration and the resolution of conflicts between schemas may be carried out in a mathematically rigorous setting, using simple concepts from category theory; this proposal is shown to be consistent with the way in which queries on a federated database are processed (by ‘distributing’ them among its component databases).

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. Buneman, P.: Functional Programming and Databases. Research Topics in Functional Programming (D. A. Turner, ed.) (1990) Addison-Wesley.

    Google Scholar 

  2. Buneman, P., Jung, A., Ohori, A.: Using powerdomains to generalize relational databases. Theoretical Computer Science 91 (1991) 23–55

    Google Scholar 

  3. Carpenter, R., The Logic of Typed Feature Structures. Cambridge Tracts in Theoretical Computer Science 32 (1992) Cambridge University Press.

    Google Scholar 

  4. Cartmell, J.: Formalising the network and hierarchical data models-an application of categorical logic. Category Theory and Computer Programming (D. Pitt et. al., eds.) Lecture Notes in Computer Science 240 (1986) Springer.

    Google Scholar 

  5. Dampney, C.N.G., Johnson, M., Monro, G.: An illustrated mathematical foundation for ERA. The Unified Computation Laboratory (Rattray, C.M.I., Clark, R.G., eds.) (1992) Oxford University Press.

    Google Scholar 

  6. Ehrich, H.D.: Category Theory and Computer Programming (Pitt D., et. al. ed.) Lecture Notes in Computer Science 240 (1986) Springer.

    Google Scholar 

  7. Pierce, B.: Basic Category Theory for Computer Scientists. MIT Press (1991)

    Google Scholar 

  8. Rosebrugh, R., Wood, R.J.: Relational databases and indexed categories. Proceedings of CT '91 (1992)

    Google Scholar 

  9. Srinivasan, U., Ngu, A.: Multi-level lateral schema translation in heterogeneous clinical databases. draft, (1992)

    Google Scholar 

  10. Vickers, S.J.: Geometric theories and databases. Proc. 1991 Durham Symposium on Applications of Categories in Computer Science (Fourman, M., Johnstone, P.T., Pitts, A.M., eds.) Cambridge University Press (1992)

    Google Scholar 

  11. Walters, R.F.C.: Categories and Computer Science. Cambridge University Press (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Masami Hagiya John C. Mitchell

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Islam, A., Phoa, W. (1994). Categorical models of relational databases I: Fibrational formulation, schema integration. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_118

Download citation

  • DOI: https://doi.org/10.1007/3-540-57887-0_118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57887-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics