vix.ing · top · new · best · stats · spec

An Algebraic Theory for Data Linkage

2018/10/12 by Liang-Ting Chen, Markus Roggenbach, John V. Tucker
Computer Science · #Advanced Database Systems and Queries #Algebra over a field #Algebraic number #Algebraic specification #Algebraic theory #Axiom #Axiomatic system #Linkage (software) #Logic, Reasoning, and Knowledge #Monoid #Semantic Web and Ontologies #cs.LO

paper · pdf · doi:10.1007/978-3-030-23220-7_3

For WADT'18

arxiv created 2018/10/12 · openalex created_date 2018/10/26 · openalex publication_date 2019/01/01 · arxiv updated 2021/01/26 · openalex updated_date 2026/08/05

Abstract

There are countless sources of data available to governments, companies, and citizens, which can be combined for good or evil. We analyse the concepts of combining data from common sources and linking data from different sources. We model the data and its information content to be found in a single source by a partial ordered monoid, and the transfer of information between sources by different types of morphisms. To capture the linkage between a family of sources, we use a form of Grothendieck construction to create a partial ordered monoid that brings together the global data of the family in a single structure. We apply our approach to database theory and axiomatic structures in approximate reasoning. Thus, partial ordered monoids provide a foundation for the algebraic study for information gathering in its most primitive form.

Citations