An Algebraic Theory for Data Linkage - Recent Trends in Algebraic Development Techniques Access content directly
Conference Papers Year : 2019

An Algebraic Theory for Data Linkage

Liang-Ting Chen
  • Function : Author
  • PersonId : 1058311
Markus Roggenbach
  • Function : Author
  • PersonId : 1030922
John V. Tucker
  • Function : Author
  • PersonId : 1030914


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.
Fichier principal
Vignette du fichier
486157_1_En_3_Chapter.pdf (476.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02364574 , version 1 (15-11-2019)





Liang-Ting Chen, Markus Roggenbach, John V. 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⟩
52 View
17 Download



Gmail Facebook X LinkedIn More