Saturation of the morphisms in the database category
Logic in Computer Science
2014-05-16 v1
Abstract
In this paper we present the problem of saturation of a given morphism in the database category DB, which is the base category for the functiorial semantics of the database schema mapping systems used in Data Integration theory. This phenomena appears in the case when we are using the Second-Order tuple-generating dependencies (SOtgd) with existentially quantified non-built-in functions, for the database schema mappings. We provide the algorithm of the saturation for a given morphism, which represents a mapping between two relational databases, and show that the original morphism in DB can be equivalently substituted by its more powerful saturated version in any commutative diagram in DB.
Keywords
Cite
@article{arxiv.1405.3955,
title = {Saturation of the morphisms in the database category},
author = {Zoran Majkic},
journal= {arXiv preprint arXiv:1405.3955},
year = {2014}
}
Comments
17 pages, 1 figure