Skip to Main content Skip to Navigation
Conference papers

An Algebraic Theory for Data Linkage

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 an ordered partial 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 an ordered partial 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, ordered partial monoids provide a foundation for the algebraic study for information gathering in its most primitive form.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-02364574
Contributor : Hal Ifip <>
Submitted on : Friday, November 15, 2019 - 9:03:15 AM
Last modification on : Wednesday, June 9, 2021 - 3:26:02 PM
Long-term archiving on: : Sunday, February 16, 2020 - 1:31:50 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Liang-Ting Chen, Markus Roggenbach, John Tucker. An Algebraic Theory for Data Linkage. 24th International Workshop on Algebraic Development Techniques (WADT), Jul 2018, Egham, United Kingdom. pp.47-66, ⟨10.1007/978-3-030-23220-7_3⟩. ⟨hal-02364574⟩

Share

Metrics

Record views

105