%0 Conference Proceedings
%T An Algebraic Theory for Data Linkage
%+ Department of Computer Science [Swansea]
%A Chen, Liang-Ting
%A Roggenbach, Markus
%A Tucker, John, V.
%Z Part 3: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 24th International Workshop on Algebraic Development Techniques (WADT)
%C Egham, United Kingdom
%Y José Luiz Fiadeiro
%Y Ionuț Țuțu
%I Springer International Publishing
%3 Recent Trends in Algebraic Development Techniques
%V LNCS-11563
%P 47-66
%8 2018-07-02
%D 2018
%R 10.1007/978-3-030-23220-7_3
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 1
%Z WG 1.3
%2 https://inria.hal.science/hal-02364574/document
%2 https://inria.hal.science/hal-02364574/file/486157_1_En_3_Chapter.pdf
%L hal-02364574
%U https://inria.hal.science/hal-02364574
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-3
%~ IFIP-WADT
%~ IFIP-LNCS-11563