Abstract
Allegories abstract useful features of the enriched category of sets and binary relations. N-ary relations can be easily defined in any allegory with relational products as binary relations between appropriate product objects. Unfortunately, in many applications (especially those related to databases) such an indirect way of thinking about N-ary relations is somewhat awkward. In this paper we develop a formalism for allegorical generalisations of N-ary relations particularly well suited for database applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Data Mining Extensions (DMX) Reference, https://msdn.microsoft.com/en-us/library/ms132058.aspx
Barr, M., Wells, C.: Category theory for computing science. Prentice-Hall International Series in Computer Science. Prentice Hall (1995)
Berghammer, R., Haeberer, A., Schmidt, G., Veloso, P.: Comparing two different approaches to products in abstract relation algebra. In: Algebraic Methodology and Software Technology (AMAST 1993), pp. 167–176. Springer (1994)
Brown, C., Hutton, G.: Categories, allegories and circuit design. In: Proceedings of the Symposium on Logic in Computer Science, LICS 1994, pp. 372–381. IEEE (1994)
Brown, C., Jeffrey, A.: Allegories of circuits. In: Matiyasevich, Y.V., Nerode, A. (eds.) LFCS 1994. LNCS, vol. 813, pp. 56–68. Springer, Heidelberg (1994)
Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377–387 (1970), http://doi.acm.org/10.1145/362384.362685
Davey, B., Priestley, H.: Introduction to Lattices and Order. Cambridge mathematical text books. Cambridge University Press (2002)
Desharnais, J.: Monomorphic characterization of n-ary direct products. Inf. Sci. 119(3-4), 275–288 (1999), http://dx.doi.org/10.1016/S0020-02559900020-1
Freyd, P., Scedrov, A.: Categories, Allegories. North-Holland Mathematical Library. Elsevier Science (1990)
Givant, S.: The calculus of relations as a foundation for mathematics. Journal of Automated Reasoning 37(4), 277–322 (2006), http://dx.doi.org/10.1007/s10817-006-9062-x
Schmidt, G., Ströhlein, T.: Relations and graphs. Springer, Heidelberg (1993)
Schmidt, G., Winter, M.: Relational mathematics continued. arXiv:1403.6957 (2014)
Tarski, A., Givant, S.R.: A formalization of set theory without variables, vol. 41. American Mathematical Soc. (1987)
Winter, M.: Products in categories of relations. The Journal of Logic and Algebraic Programming 76(1), 145–159 (2008)
Zieliński, B., Maślanka, P.: Weak n-ary relational products in allegories. Axioms 3(4), 342–357 (2014)
Zieliński, B., Maślanka, P., Sobieski, Ś.: Allegories for database modeling. In: Cuzzocrea, A., Maabout, S. (eds.) MEDI 2013. LNCS, vol. 8216, pp. 278–289. Springer, Heidelberg (2013), http://dx.doi.org/10.1007/978-3-642-41366-7_24
Zieliński, B., Maślanka, P., Sobieski, Ś.: Modalities for an allegorical conceptual data model. Axioms 3(2), 260–279 (2014), http://www.mdpi.com/2075-1680/3/2/260
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zieliński, B. (2015). Generalised N-ary Relations and Allegories. In: Kahl, W., Winter, M., Oliveira, J. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2015. Lecture Notes in Computer Science(), vol 9348. Springer, Cham. https://doi.org/10.1007/978-3-319-24704-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-24704-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24703-8
Online ISBN: 978-3-319-24704-5
eBook Packages: Computer ScienceComputer Science (R0)