2014/05/14 by Zoran Majkic, Zoran Majkić, Majkic, Zoran
Computer Science · #Advanced Database Systems and Queries #Data Management and Algorithms #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1405.3955
17 pages, 1 figure
arxiv created 2014/05/14 · openalex publication_date 2014/05/14 · arxiv updated 2014/05/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.