# An Algebraic Theory for Data Linkage

Liang-Ting Chen, Markus Roggenbach, John V. Tucker

► To cite this version:

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

HAL Id: hal-02364574

https://inria.hal.science/hal-02364574

Submitted on 15 Nov 2019

HAL is a multi-disciplinary open access
archive for the deposit and dissemination of sci-
entific research documents, whether they are pub-
lished or not. The documents may come from
teaching and research institutions in France or
abroad, or from public or private research centers.

L'archive ouverte pluridisciplinaire HAL, est
destinée au dépôt et à la diffusion de documents
scientifiques de niveau recherche, publiés ou non,
émanant des établissements d'enseignement et de
recherche français ou étrangers, des laboratoires
publics ou privés.

<figure><img src="image_1.png" /></figure>

Distributed under a Creative Commons Attribution 4.0 International License
# An algebraic theory for data linkage*

Liang-Ting Chen, Markus Roggenbach, and John V. Tucker

Department of Computer Science, Swansea University, UK
{liang-ting.chen,m.roggenbach,j.v.tucker}@swansea.ac.uk

**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.

## 1 Introduction

There are countless public and private sources of data that can be linked and analysed for all sorts of reasons, and with all sorts of consequences. The extraordinary variety of what may be considered data—i.e., data that is informative in some way—is a challenge to attempts to discover general principles and techniques for understanding linkage. Motivated by movements for data sharing we try to uncover general structures common to disparate situations.

### 1.1 Motivation: Exploiting open datasets

The vast stores of data built up by governments, agencies, institutions and companies in the course of their operations hold information of value in diverse and unexpected situations. Some governments have launched initiatives to encourage bodies to share their data with other organisations and the public. The released open data is intended to improve transparency, allowing accountability and engagement with decision making. A systematic review is [2].

For example, in the UK, there are several national and local registers and a plethora of statistical data that are now widely shared. A simple example of the commercial use of open datasets are web services for selling and letting properties such as Zoopla. In addition to traditional information about a property, official financial data about local house sales and crime statistics are provided.

* This research was supported by the EPSRC project Data Release—Trust, Identity, Privacy and Security (EP/N028139/1 and EP/N027825/1).
The UK's Open Data Initiative demonstrates the ambition to publish internal government data as open datasets. There are many patterns of data sharing, of which three are particularly important: i) making data public—data release into the wild; ii) data sharing by contract with a data analysis organisation; and iii) data sharing with delegation to a new data controller for further onward sharing. However, data custodians have a legal duty, and a social duty of care, to ensure that privacy is not breached by the release of open data sets.

The technical question arises: What information is revealed by, or can be inferred from, the data? Naturally, prior to its release, a data set can be filtered and anonymised but i) anonymisation is difficult and often flawed; and ii) data from various other sources can be combined with a given data set to reveal much more. There are many data sources to call upon, and many unknown unintended consequences in making data publicly available.

An early example is Sweeney's finding [23] that 97% of voters in Cambridge, Massachusetts, USA, can be uniquely identified by birth dates and postcodes; these can be further linked with a hospital discharge database to discover individuals' medical history—e.g., of the governor of Massachusetts at that time [24].

Lately, Narayanan and Shmatikov [17] devised an algorithm exploiting sparsity to combine datasets. As a case study they analysed the Netflix prize dataset and found '84% of (Netflix) subscribers present in the dataset can be uniquely identified if the adversary knows six out of eight movies outside the top 500' that the subscriber rated. Such source of film ratings may come from social engineering or the Internet Movie Database (IMDb). In response to these privacy concerns, Netflix decided to withdraw the datasets. Unfortunately, they are still available to download using BitTorrent or https://archive.org.

## 1.2 Algebraic models of combination and linkage

In this paper we take a fresh look at the challenge of combining data sets and linking pieces of data. Our aim is to develop abstract tools to analyse formally the general nature of data sharing, and technical issues of policy specification and compliance. To this end, we seek algebras of data representations, whose operations combine two or more pieces of data from the same source to form data with higher information content. These data representation algebras are to be defined axiomatically. In its simplest form—that presented here—such an algebra is an ordered structure with a partial commutative binary operation $\oplus$ and an identity element 0, namely, an *ordered partial commutative monoid*. The operation $\oplus$ *combines* data from the same source. Morphisms between such monoids model the transfer of data between sources—a process we call *linkage*. We create an ordered partial commutative monoid that brings together all the data from a family of sources using a simplified Grothendieck construction. We show that our monoid theory of linkage applies to databases and approximate reasoning.

A complete set of proofs can be found at arXiv:1810.08096.
# 2 Algebras for data combination

## 2.1 Information ordering

Data itself is often hierarchical or due to uncertainty becomes so. In this paper, when we reason about data, we implicitly work on a set with an ordering that measures specificity, knowledge, or informativeness. Ideas of information ordering are nothing new, as they appear to be well-known to different communities working on uncertainty reasoning [11, Section 2.7], multi-valued logic [3], program semantics [20], formal concept analysis [6, Chapter 3], and (implicitly) anonymisation techniques [16, 26], to name but a few.

**Definition 2.1.** Given a set $X$, an information order $\leq$ on $X$ is a preorder, i.e. i) $x \leq x$ and ii) $x \leq y \leq z$ implies $x \leq z$. An information space is merely a preordered set $(X, \leq)$.

To illustrate the use of preordered sets in the context of data release and privacy, we discuss in some detail the use of postcodes to identify locations.

*Example 2.2.* The taxonomic hierarchy of British postal codes mostly consists of 6 to 8 alphanumeric characters in a format detailed below. Each postcode is divided into the outward code and the inward code by a single space ‘.’. Each component is formed of two further parts and each part covers a smaller area. For example, SA2$\sqcup$8PP is the full postcode of the Singleton Campus of Swansea University and it is understood as follows:

<table><thead><tr><th>SA</th><th>2</th><th>8</th><th>PP</th></tr></thead><tbody><tr><td>Postcode Area</td><td>Postcode District</td><td>Postcode Sector</td><td>Postcode Unit</td></tr><tr><td colspan="2">Outward Code</td><td colspan="2">Inward Code</td></tr><tr><td colspan="4">Postcode</td></tr></tbody></table>

Let the set of all full postcodes be denoted by $Post_{UK}$.

For simplicity, a *partial* postcode refers to a code, where less significant parts might be missing, ordered by prefix order including the empty string ‘$e$’ as a special postcode indicating everywhere. For example, $SA$ stands for Swansea and $SA2$ for a district in Swansea, and we have partial postcodes

$$ \epsilon \preceq SA \preceq SA2 \preceq SA2 \sqcup 8 \preceq SA2 \sqcup 8PP $$

note that $???\sqcup$8PP is not a partial postcode. Let us denote the set of all partial postcodes by $PPost_{UK}$.

Each full postcode is incomparable with another, as each of them stands for a disjoint set of postal addresses. On the contrary, the set of partial postcodes possesses the prefix order $\leq$ for the hierarchy. Every partial postcode $P$ can be realised as a set of full postcodes by

$$ [P] := \{ p \in Post_{UK} \mid P \text{ is a prefix of } p \}. $$

For instance, an empty string $\epsilon$ is realised by $Post_{UK}$, as it contains no information apart from being a postcode. Each full postcode $P$ in $Post_{UK}$ is realised by the singleton set $\{P\}$. Note that $[P]$'s are always non-empty. $\square$
The reader may find our definition of information space intriguing. For example, why is this only a preordered set instead of a partially ordered set? Indeed, as we can observe from the above example, there are two possible representations of partial knowledge for postcode:

i) $\mathbb{P}^+(\mathbf{Post}_{UK})$—the non-empty powerset of full postcodes, or

ii) $\mathbf{PPost}_{UK}$—the set of partial postcodes determined by its format.

The first (i) can be called the *possible world representation* [11, Section 2.1]. It is well-understood in the community of knowledge representation. It is more expressive and general than (ii). Every taxonomic hierarchy of a set of entities can be realised by a possible world interpretation, as each classification level defines a partition of all the entities. The reverse inclusion order ‘$\supseteq$’ reflects the information order of taxonomic hierarchy, i.e. $P$ is of higher hierarchy than $Q$ only if $[[P]] \subseteq [[Q]]$ and ‘$\supseteq$’ is surely a partial order. We return to this general points in Section 3.2.

On the other hand, the second kind of representations is often what we have in the first place or what we would like to use in data release. The information order $\leq$ requires some effort to decide, but generally it is clear from the context. However, we may have two different representations for the very same set of entities. If a weight is attached to the data in question, then the second representation is more manageable than the first:

*Example 2.3.* Consider a version due to a privacy concern.<fnref n="1" /> Both kinds of representations build a frequency distribution, and some probabilities can be calculated based on the information order over postcodes, say, $\text{Pr}[\mathbf{SA2} \leq X]$.

<figure><img src="image_2.png" /><figcaption>Figure 1: Datasets containing postal information</figcaption></figure>

In Kolmogorov’s probability theory, the first step is to find out a sample space $\Omega$ and a $\sigma$-algebra $\Sigma$, and the typical choice is $\Omega = \mathbf{Post}_{UK}$ and $\Sigma = \mathbb{P}(\mathbf{Post}_{UK})$. The probability measure for the original dataset (Fig. 1a) is clear. But, it is tricky to define faithfully a probability measure for the sanitised dataset (Fig. 1b), since it requires to assign a probability to each full postcode with the prefix $\mathbf{SA1_3}$. The convention is to apply the principle of indifference—each postcode of

<footnote n="1">¹ Some privacy protection models are achieved by generalisation and suppression of cell values, see [24] for example.</footnote>
[SA1_3] has the same probability 1/k where k is the possibly unknown number of postcodes in [SA1_3]. Even if k is known, the presumed probability 1/k is an over-approximation of the given information.

On the other hand, no matter what probability is assigned to subsets of full postcodes, the probability of Pr[SA2 $\leq$ X] is always the sum

$$ \sum_{SA2 \leq Q} \Pr[X = Q] = 3/4 $$

without knowing any further information. The expressiveness is limited if we confine ourselves to probabilities of partial postcodes only, since partial postcodes are not closed under Boolean connectives contrary to the subset representation. Yet this limitation enables us to represent the exact information of data. □

Another problem of the possible world representation arises if the information order is by nature not anti-symmetric. It is intuitive to see that Fig. 1a is more informative than Fig. 1b. There are at least three applicable orderings over subsets P, Q of elements in an information space X, which are

$$ P \preceq^{\flat} Q \iff \forall x \in P. \exists y \in Q. x \preceq y $$

$$ P \preceq^{\flat} Q \iff \forall y \in Q. \exists x \in P. x \preceq y $$

$$ P \preceq^{\flat} Q \iff P \preceq^{\flat} Q \wedge P \preceq^{\flat} Q $$

The ordering can model a number of processes or situations. $P \preceq^{\flat} Q$ models that everything in P has a more informative datum in Q. So Q is an enrichment of P. Conversely, $P \preceq^{\flat} Q$ models that everything in Q has a less informative datum in P, so P is an adulteration of Q.

Each of the orderings plays a role in various contexts, such as non-deterministic computation [9] and relative likelihood [11, Section 2.7]. These orderings are preorders but not anti-symmetric in general.

*Example 2.4.* Ignoring user ID and repetitions, we have two sets representing the information in Fig. 1:

$$ P_1 := \{SA2 \sqcup 8PP, SA2 \sqcup 8PW, SA1 \sqcup 3LP, SA2 \sqcup 8QF\} $$

$$ P_2 := \{SA2 \sqcup 8, SA1 \sqcup 3\} $$

The set $P_1$ is more informative than $P_2$ with respect to $\preceq^{\flat}$, $\preceq^{\flat}$, and $\preceq^{\flat}$. □

Even further, the standard equality ‘=’ on the data in X is irrelevant from the information-theoretic perspective, as we only care about the information content of data. For example, any subset P of an information space (X, $\leq$) is indistinguishable from but fails to be equal to its convex hull<fnref n="2" /> $K(P) := \{a \in X | \exists x, y \in P. x \leq a \leq y\}$, i.e.

$$ P \preceq^{\flat} K(P) \preceq^{\flat} P \quad \text{but generally} \quad P \neq K(P). $$

So, we introduce:

<footnote n="2">² See, e.g., [6, p.63].</footnote>
**Definition 2.5.** Given an information order $\leq$ on a set X, define an equivalence relation by

$$x \cong y \iff x \leq y \text{ and } y \leq x$$

and x is said to be equivalent to y. Each element in the same equivalence class is of the same information content.

From a mathematical viewpoint, each element x is a representative of the information class [x]. Every representative of the same class embodies the same amount of information with respect to the information order $\leq$. Computing and deciding the information class could be costly and conceptually gain little, so it is easier to work and present our latter formulations with representatives directly.

**Remark 2.6.** From this, we can argue further that '$\cong$' is the right notion of equality where the strict equality '$=$' plays no role at all in an ordered setting. Indeed, the convention is to consider the quotient $(X/\cong, \leq/\cong)$ as the poset of information and $[x] = [y]$ is equivalent to $x \cong y$, but this convention makes notations rather heavy.

So the point is that only the preorder $\leq$ for information matters and it fails to be a partial order in general.

## 2.2 Ordered partial commutative monoids

To combine and link data across various domains yields data that is presumably more informative than the separate pieces of information alone. In this section, we introduce an algebraic operation over an information space for combining data. Central to our investigation is the concept of ordered partial commutative monoids. Whilst monoids of many kinds, e.g., ordered commutative monoids [8] and partial commutative monoids [7, 27], have been discovered and developed in many application areas, surprisingly we have not found a monoid combining both—ordering and partiality. A possible exception we found is monoids viewed as a degenerated class of partial monoidal categories defined in [5].

**Definition 2.7.** An ordered partial commutative monoid $(M, \leq, \oplus, 0)$ consists of i) a *preordered set* $(M, \leq)$, ii) a *constant* $0 \in M$, and iii) a *partial binary operation* $\oplus: M \times M \to M$, i.e. $x \oplus y$ may not be defined. For brevity, '$x \perp y$' stands for '$x \oplus y$' is defined. Further, $(M, \leq, \oplus, 0)$ satisfies the properties below.

$$(\text{OPCM1}) \quad 0 \oplus x \cong x.$$

$$(\text{OPCM2}) \quad y \perp x \text{ and } x \oplus y \cong y \oplus x \text{ if } x \perp y.$$

$$(\text{OPCM3}) \quad x \perp y, (x \oplus y) \perp z, \text{ and } x \oplus (y \oplus z) \cong (x \oplus y) \oplus z \text{ if } y \perp z \text{ and } x \perp (y \oplus z).$$

$$(\text{OPCM4}) \quad x_1 \oplus y \leq x_2 \oplus y \text{ if } x_i \perp y \text{ for } i = 1, 2 \text{ and } x_1 \leq x_2.$$

An ordered partial commutative monoid is written as *OPCM for short*. An (unordered) partial commutative monoid $(M, \oplus, 0)$, *PCM for short*, is an *OPCM with the discrete ordering $x \leq y \iff x = y$. An ordered commutative monoid is an *OPCM with the binary operation $\oplus$ being total.*
The element $x \oplus y$ denotes data that represents a combination of the information of $x$ and $y$. The constant $0$ stands for some vacuous information so that $x \oplus 0$ is always defined and equivalent to $x$. Partiality enables us to encapsulate consistency or other premises. That is, $x$ may contradict $y$ so that no viable information can be derived; see Example 2.13.

Referring to Remark 2.6, the following fact shows that the use of '$\cong$' is equivalent to the standard equality '$=$' in the partially ordered quotient:

**Proposition 2.8.** Let $(M, \preceq, \oplus, 0)$ be an OPCM. Then,

i) the relation defined by $[x] \leq [y] \iff x \leq y$ on the quotient set $M/\cong$ is a partial order and $[x] = [y] \iff x \cong y$;

ii) $(M/\cong, \leq, [\oplus], [0])$ with $[x] [\oplus] [y]$ defined as $[x \oplus y]$ is an OPCM.

The algebraic structure of a PCM also gives rise to a natural ordering between information purely determined by the combination $\oplus$.

**Definition 2.9.** The algebraic ordering on an OPCM is defined by

$$x \sqsubseteq y \iff \exists z. x \oplus z \cong y.$$

**Proposition 2.10.** Every PCM $(M, \oplus, 0)$ with algebraic ordering $\sqsubseteq$ is an

i) OPCM which satisfies

ii) $0 \sqsubseteq x$, and that

iii) if $(x, y) \sqsubseteq (x', y')$, $x' \perp y'$, $x \perp x'$, then $x \oplus y \sqsubseteq x' \oplus y'$.

The algebraic ordering of an OPCM $(M, \preceq, \oplus, 0)$ is compatible with the information ordering if the identity $0$ is the $\preceq$-least informative element:

**Proposition 2.11.** Let $(M, \preceq, \oplus, 0)$ be an OPCM such that $0 \preceq x$. Then,

i) $x \sqsubseteq y \implies x \preceq y$;

ii) $x, y \preceq x \oplus y$ whenever $x \perp y$.

*Remark 2.12.* The implication *i*) in Proposition 2.11 along with *ii*) in Proposition 2.10 suggests the hypothesis $0 \preceq x$ is decisive, otherwise $\oplus$ may not represent ‘combination of information’ but something else (cf. the semantics of Belnap’s 4-valued logic [1]). However, the property that $0 \preceq x$ for all $x \in M$ is not needed for our technical results.

*Example 2.13.* Consider the collection of all non-empty subsets of full post-codes $\mathbb{P}^+(\text{Post}_{\text{UK}})$ equipped with the reverse inclusion order $P_1 \preceq P_2$ iff $P_2 \subseteq P_1$. The intersection $\cap$ of subsets as a combination operation $\oplus$, is a partial operation, since $P_1 \cap P_2$ might be empty and $\notin \mathbb{P}^+(\text{Post}_{\text{UK}})$. Clearly, intersection is monotone with respect to the reverse inclusion order. Similarly, the set of partial postcodes equipped with the prefix ordering $\preceq$ discussed in Example 2.2 has a simple OPCM structure: $x \oplus y$ is defined as $\max\{x, y\}$.
## 2.3 Homomorphisms

The internal structure of an OPCM models data and information of a single source. So the external interaction between OPCMs models a comparison, combination, interpretation, or linkage between sources. Various kinds of structure preserving maps between OPCMs arise naturally, e.g., order-preserving maps, ⊕-preserving maps, or both. We begin with the familiar one.

**Definition 2.14.** A homomorphism $M \xrightarrow{f} N$ of OPCMs is a function satisfying

$$ (HOM1) \quad x \preceq_M y \implies fx \preceq_N fy $$

$$ (HOM2) \quad f(0_M) \cong 0_N $$

$$ (HOM3) \quad x \perp y \implies f(x \oplus_M y) \cong fx \oplus_N fy $$

The collection of OPCMs with their homomorphisms forms a category $\mathbf{PCM}_{\leq}$.

An 'interpretation' of information in a different domain of discourse or context, is a typical example of a homomorphism. The trivial map $f: M \to N$ defined by $f(x) = 0$ is a homomorphism that destroys all the information in $M$. The set of partial postcodes per se is merely a set of strings following a specific format, so it makes little sense to say how rare a postcode $P$ is among other postcodes; it becomes meaningful when it refers to certain geographic area, population, or other associated information.

*Example 2.15.* Let $\mathbf{Pop}_{\text{UK}}$ denote the UK population. Assume that $i$) everyone (of interest) is registered with exactly one postcode for their main residence, and $ii$) each postcode is associated with someone. The assumption amounts to a surjective function $f: \mathbf{Pop}_{\text{UK}} \to \mathbf{Post}_{\text{UK}}$.

Consider the possible world representation for $\mathbf{Pop}_{\text{UK}}$. Each set $S$ of postcodes then can be interpreted as the set $[S] := f^{-1}(S) \subseteq \mathbf{Pop}_{\text{UK}}$ of population officially registered in the area specified by $P$. The mapping $[\cdot] : \mathbb{P}^{+}\mathbf{Post}_{\text{UK}} \to \mathbb{P}^{+}\mathbf{Pop}_{\text{UK}}$ is clearly homomorphic w.r.t. the OPCM discussed in Example 2.13, since

i) it is monotone, as $[S_1] \supseteq [S_2]$ if $S_1 \supseteq S_2$;

ii) it preserves the identity, as $f^{-1}(\mathbf{Post}_{\text{UK}}) = \mathbf{Pop}_{\text{UK}}$;

iii) and moreover $[S_1 \cap S_2] = [S_1] \cap [S_2]$ as $f^{-1}$ preserves intersection. $\square$

Besides concrete homomorphisms, one has the following standard notions: isomorphism, monomorphism, embedding, epimorphism, and so on, following the doctrine of category theory. Among them, the product of two OPCMs can be understood as pairs of independent sources of information.

**Definition 2.16.** The product monoid $M_1 \times M_2$ of $M_i = (M_i, \preceq_i, \oplus_i, 0_i)$ for $i = 1, 2$ is the cartesian product equipped with

i) the pointwise ordering $(x_1, x_2) \preceq (y_1, y_2) \iff x_1 \preceq_1 y_1 \wedge x_2 \preceq_2 y_2$,

ii) $0 := (0_1, 0_2)$, and

iii) $(x_1, x_2) \oplus (y_1, y_2) := (x_1 \oplus_1 y_1, x_2 \oplus_2 y_2)$ if $x_1 \perp y_1$ and $x_2 \perp y_2$.
The universal property for product shows that $M_1 \times M_2$ consists of pairs of independent pieces of information from $M_1$ and $M_2$:

**Proposition 2.17.** For any OPCM $N$ and any pair of homomorphisms $f_i: N \to M_i$ for $i = 1, 2$, there exists a unique homomorphism $h: N \to M_1 \times M_2$ such that $\pi_i \circ h = f_i$, where $\pi_i$ is the $i$-th projection homomorphism.

Other useful notions are embedding and isomorphism.

**Definition 2.18.** A homomorphism $e: M \to N$ is an order-embedding if it not only preserves but also reflects the ordering: $e(x) \preceq e(y) \iff x \preceq y$. An isomorphism is a bijective order-embedding.

# 3 Further examples

## 3.1 Flat algebras

The most simple OPCM is perhaps a set $X$ equipped with an additional element $\perp$ denoting unknown and $x \le y$ iff $x = \perp$ or $x = y$ with $x \oplus y := (\text{the join of } x \text{ and } y)$. In spite of its simplicity, it has been elaborated further in relational database theory [4, Chapter 8].

## 3.2 Possibilities over a set

We have used a possible world representation discussing postcodes (Section 2.2). In this section, we study its general properties. As the reader may have observed from our examples about non-empty subsets of full postcodes, the argument is completely generic and can be applied to any non-empty set $X$. In short, we have the following generalisation of Example 2.13:

**Proposition 3.1.** For any non-empty set $X$, the non-empty powerset $\mathbb{P}^+X$ with the reverse inclusion and intersection forms an OPCM $(\mathbb{P}^+X, \supseteq, \cap, X)$.

In general, the set $X$ represents some elementary form of atomic information such as codes, labels, tags or facts from which is made. The data in the source is a non-empty subset $S$ of $X$ containing a set of possible choices from $X$.

## 3.3 Possibilities over an OPCM

It is often the case that only pieces of information shared by a group of people is known instead of each individual's. As each piece of information in our algebraic theory is an element of some OPCM, we proceed with non-empty subsets of an OPCM which is in turn another OPCM.

The starting point is the observation that a mere intersection of two subsets of an OPCM $(M, \preceq, \oplus, 0)$ would exclude combinable but not exactly the same information. Note that we can reformulate intersection in a rather silly way as

$$P \cap Q = \{x \mid x \in P, y \in Q, x = y\}$$
We can utilise ‘⊕’ and define a combination of two subsets of OPCM by

$$P \oplus Q := \{ x \oplus y | x \in P, y \in Q, x \perp y \}$$

consisting of refined information only. How about the information order between subsets? It turns out that only one of the orderings for powersets introduced in Section 2.1,

$$P \preceq^{\#} Q \iff \forall y \in Q. \exists x \in P. x \preceq y$$

is a sensible preorder with respect to the definition of $P \oplus Q$.

**Theorem 3.2.** Let $(M, \preceq, \oplus, 0)$ be an OPCM such that $M$ is $\oplus$-downward closed, i.e. if $x \preceq x'$ and $x' \perp y$ then $x \perp y$. For non-empty subsets $P$ and $Q$,

$$P \oplus Q := \{ x \oplus y | x \in P, y \in Q, x \perp y \}.$$

Then,

i) $\mathbb{P}+M = (\mathbb{P}+M, \preceq^{\#}, \oplus, \{0\})$ is also an OPCM;

ii) $\{0\} \preceq^{\#} P$ for any $P$ if $0 \preceq x$ for any $x \in M$.

# 4 Data linkage

A domain of discourse can have a number of data sources so that the same piece of information can be understood in various contexts differently. How do we know that the original information remains intact?

## 4.1 Change of domain

A homomorphism $f: M \to N$ qualifies as a mapping changing domains from $M$ to $N$ but it can lose data, e.g. the trivial map $f(x) = 0$ destroys all data. One way to avoid this problem is to use homomorphisms with a restriction map $f^*: N \to M$ satisfying a ‘preservation condition’ $x \preceq f^*f(x)$ for $x \in M$.

**Definition 4.1.** A homomorphism $f: M \to N$ is a change of domain if $f$ is a lower adjoint,<fnref n="3" /> i.e. there exists an order-preserving map $f^*: N \to M$ such that

$$fx \preceq_N y \iff x \preceq_M f^*y$$

Our formal definition requires that an extension $f$ with its restriction $f^*$ forms a Galois connection [6].

Every Galois connection $(f, f^*)$ gives rise to a closure operator—a monotone function $f^* \circ f$ satisfying i) $x \preceq f^*f(x)$ and ii) $f^*f(f^*fx) \preceq f^*fx$. Intuitively, the information represented by $f^*f(x)$ is at least as informative as $x$.

<footnote n="3">³ Every adjoint is unique up to order isomorphism—that is, if $g$ is an upper adjoint of $f$ then $f^*y \cong gy$ for any $y$, so we can say that a homomorphism $f$ is a change of domain without referring to $f^*$.</footnote>
The class of changes of domain is closed under composition. It is not hard to see that the composite $k \circ f$ of two lower adjoints is again a lower adjoint, because $k \circ f$ is homomorphic and by definition

$$k(fx) \preceq z \iff fx \preceq k^*z \iff x \preceq f^*k^*z.$$

Trivially, an identity function $id$ is itself a change of domain. Therefore, the class of OPCMs and changes of domain forms a subcategory of $\mathbf{PCM}_{\preceq}$.

**Example 4.2.** The homomorphism $\llbracket - \rrbracket : \mathbb{P}^+\mathbf{Post}_{\mathbf{UK}} \to \mathbb{P}^+\mathbf{Pop}_{\mathbf{UK}}$ discussed in Example 2.15 is indeed a change of domain. The restriction from $\mathbb{P}^+\mathbf{Pop}_{\mathbf{UK}}$ to $\mathbb{P}^+\mathbf{Post}_{\mathbf{UK}}$ is given by mapping a set of population to the set of their registered postcodes. The existence of this restriction follows from the assumption that everyone of interest signs a register with a full postcode. Formally, the restriction is the forward-image function of the surjection $f: \mathbf{Pop}_{\mathbf{UK}} \to \mathbf{Post}_{\mathbf{UK}}$ given by our assumption, so

$$\llbracket S \rrbracket \preceq A \iff f^{-1}(S) \supseteq A \iff S \supseteq f[A] \iff S \preceq f[A]$$

for any non-empty $S \subseteq \mathbf{Post}_{\mathbf{UK}}$ and $A \subseteq \mathbf{Pop}_{\mathbf{UK}}$.

Given a change of domain $f: M \to N$, there are two different ways to combine $x \in M$ with $y \in N$. Their relationship can be stated as follows:

**Proposition 4.3.** Given a change of domain $f: M \to N$, the following

$$x \oplus f^*y \preceq f^*(fx \oplus y)$$

always holds for any $x \in M$ and $y \in N$.

Armed with these notions, we now formally define ‘linkage’ as follows.

**Definition 4.4.** A linking passage $(f_i, g_i)_{i=1,2}$ of $M_1$ and $M_2$ is a commutative diagram of changes of domain up to equivalence:

<figure><img src="image_3.png" /></figure>

i.e. the equation $f_1 \circ g_1(k) \cong f_2 \circ g_2(k)$ for any $k \in K$. Given a linking passage as above, elements $x_i \in M_i$ can be linked as $\bigoplus_i f_i x_i$ in $N$.

In the context of information, the OPCM $K$ above is some common domain of discourse between $M_1$ and $M_2$; $N$ is some domain at least including $M_1$ and $M_2$.

Given a linking passage of $M_1$ and $M_2$, there are two ways transferring information from $M_1$ to $M_2$—one through the larger domain $N$ and the other through their common domain $K$. The former route intuitively preserves more information than the other, and this intuition can be justified as follows.
**Proposition 4.5.** Given a linking passage $(f_i, g_i)_{i=1,2}$ and for any $x \in M_1$, the inequality $g_2(g_1^*(x)) \le f_2^*(f_1(x))$ holds. *Diagrammatically,*

<figure><img src="image_4.png" /></figure>

*Example 4.6.* Assume that $M_1 = \mathbb{P}^+(X \times Y)$ and $M_2 = \mathbb{P}^+(Y \times Z)$. Then,

<figure><img src="image_5.png" /></figure>

is a linking passage where $f_1, f_2, g_1, g_2$ are preimage functions of corresponding projections. Moreover, the subset $f_1(U) \cap f_2(V)$ is equal to

$$ \{(x, y, z) | (x, y) \in U \wedge (y, z) \in V\} $$

for any non-empty $U \subseteq X \times Y$ and $V \subseteq Y \times Z$, which is the *natural join* in relational database theory. For a plausible example in practice, consider $U \subseteq \mathbf{Pop}_{UK} \times \mathbf{Addr}_{UK}$ a non-empty set of suspects with their hiding places and $V \subseteq \mathbf{Addr}_{UK} \times \mathbf{Pop}_{UK}$ a non-empty set of house addresses and their owners. The combined information $f_1(U) \cap f_2(V)$ may represent triplets of suspects, addresses, and house owners who possibly provide shelters to suspects.

**Local computation scheme** In practice, each datum $x_i$ about the attribute $i$ is collected from various data sources $M_i$. To combine all $x_i$'s, we can combine them in a common domain $M$ and then restrict the combined information to a smaller domain $N$ of interest, i.e.

$$ g^* \left( \bigoplus_{i=1}^{n} f_i x_i \right) $$

represented symbolically. The computation is usually costly, however. One interesting observation stated as *the combination axiom* from [13] in a similar form is that the above information can be computed locally without the need of extending everything to $M$ if inequalities in Propositions 4.3 and 4.5 are in fact equivalences for the involved changes of domains. This observation would be useful for developing an efficient computation algorithm, however, which is beyond the scope of this paper.
## 4.2 Possibilities over a set

A surjective function $X \to Y$ gives rise to a change of domain from $\mathbb{P}^+Y$ to $\mathbb{P}^+X$. The surjectivity requirement is essential to ensure that a non-empty subset $S \subseteq Y$ is mapped to a non-empty subset $f^{-1}(S) \subseteq X$.

**Proposition 4.7.** For any surjective function $f: X \to Y$, there is a Galois connection

$$f^{-1}(V) \supseteq U \iff V \supseteq f[U]$$

where the preimage function $f^{-1}$ is a homomorphism from $\mathbb{P}^+Y$ to $\mathbb{P}^+X$ and the forward-image function $f[-]: \mathbb{P}^+X \to \mathbb{P}^+Y$ is monotonic.

It is straightforward to see that the inequality of Proposition 4.3 is an equality for any change of domain given by a surjective function. That is,

$$f[f^{-1}(U) \cap V] = U \cap f(V)$$

for any $U$ and $V$ by simple calculations.

**Proposition 4.8.** Suppose that there are $f_i: X_i \to Z$ and $g_i: Y \to X_i$ for $i=1,2$ with $g_1 \circ f_1 = g_2 \circ f_2$. Then, $(g_i^{-1}, f_i^{-1})$ is a linking passage, i.e.

<figure><img src="image_6.png" /></figure>

If a linking passage is created by functions $g_i: Y \to X_i$, then non-empty subsets $U_i \subseteq X_i$ can be linked as a subset of $Y$

$$U_1 \boxplus U_2 = g_1^{-1}(U_1) \cap g_2^{-1}(U_2).$$

*Example 4.9.* Let $A$ be a set of attributes and for each $a \in A$ a set $\Phi_a$ of values for the attribute $i$. For example, $i$ can be $g$ for ‘gender’, $p$ for ‘British postcode’, $s$ for ‘salary’, etc., then $\Phi_g$ could be the two-element set $\{\sigma, \phi\}$, $\Phi_p = \text{Post}_{\text{UK}}$ the set of all full British postcodes, and $\Phi_s = \mathbb{N}$ the set of natural numbers. Given any two sets $I, J \subseteq A$ of attributes, we have a commutative diagram

<figure><img src="image_7.png" /></figure>

where $g_i$ and $f_i$ are all projections.
# 5 Data sources and linkage

So far, an OPCM $M$ is an abstract collection of data from a data source for a single domain of discourse that can be combined and compared. A model of data linkage requires a family of PCMs ($M_i, \preceq_i, \oplus_i, 0_i$), for $i \in I$, and ways to move among various sources and domains. Further, the nature of sources and domains induces a structure to the index set $I$, typically an ordering $\preceq$, that reflects the relationship between sources and domains such as $i \preceq j$. With these components, we will model and illustrate data linkage using a form of Grothendieck construction for $I$-indexed OPCMs.

We will develop the theory in two steps and compare our construction with axiomatic frameworks in the community of approximate reasoning such as ordered valuation algebras [10] and information algebras [13, 14].

## 5.1 Grothendieck construction for preordered sets

Let $I$ be a preordered set and $P$ an $I$-indexed family of preordered sets $P_i$ for $i \in I$ together with order-preserving functions $P_i: P_i \to P_j$ whenever $i \preceq j$ satisfying

i) $P_i^i \cong id_{P_i}: P_i \to P_i$ is the identity function, and

ii) $P_k^j \circ P_j^i \cong P_k^i: P_i \to P_k$

where $P_k^j \circ P_j^i \cong P_k^i$ means $P_k^j \circ P_j^i(x) \cong P_k^i(x)$ for every $x$ and similarly for $P_i^i \cong id$. Note that $P$ is a pseudo-functor. If the above equations hold strictly, then $P$ is a (proper) functor.

**Definition 5.1.** The Grothendieck completion of $P$ consists of

$$ \int P := \{ (i, x) \mid x \in P_i \} $$

with a relation defined by

$$ (i, x) \preceq (j, y) \iff i \preceq j \text{ and } P_j^i(x) \preceq y \text{ for } x \in P_i \text{ and } y \in P_j $$

The ordering appears natural in our context: $P_j^i$ is typically a change of domain, and $P_j^i(x)$ is merely an extension of $x$ and $(i, x) \preceq (j, y)$ if and only if $j$ is a larger domain of discourse than $i$ and the extended form of $x$ is still less informative than $y$.

**Proposition 5.2.** The following statements are true:

i) The above Grothendieck completion $\int P$ is a preordered set.

ii) If $(I, \preceq)$ and every $(P_i, \preceq)$ is partially ordered, then so is $(\int P, \preceq)$.

iii) The projection $p: \int P \to (I, \preceq)$ is functorial.

iv) $p$ is an opfibration. That is, for every $(i, x) \in \int P$, $j$ with $i \preceq j$ there exists $(j, y)$ such that $(i, x) \preceq (j, y)$ and moreover for any $(k, z)$ with $(i, x) \preceq (k, z)$ and $j \preceq k$ it is also true that $(j, y) \preceq (k, z)$.
v) If each $P_j^i$ has a right adjoint, then $p$ is an bifibration, i.e. $p^{\text{op}}: (\int P, \succeq) \to (I, \succeq)$ is also an opfibration.

**Remark 5.3.** The construction presented here is a form of Grothendieck construction. The full construction works no only for preordered sets but also categories and beyond. See, e.g., [12], for details.

## 5.2 Grothendieck construction for OPCMs

In this section, we extend the Grothendieck construction to OPCMs indexed by a $\vee$-semilattice $(L, \preceq)$, where $L$ is partially ordered with a least element denoted by $\perp$ and for every pair $(i, j)$ of elements there is a least upper bound $i \vee j$. Given a (pseudo-)functor from $(L, \preceq)$ to $\mathbf{PCM}_{\preceq}$ we extend the local combination operations $\oplus_i$ for each $i \in L$ to a global combination operation $\boxplus$ for $\int M$.

To simplify our discussion, we confine ourselves to functors instead of pseudo-functors. Indeed, all of our discussion and examples in the remaining section do not require this generality.

**Theorem 5.4.** Let $(L, \preceq)$ be a bounded $\vee$-semilattice and $M: (L, \preceq) \to \mathbf{PCM}_{\preceq}$ a functor. Then, the Grothendieck completion $(\int M, \succeq)$ can be equipped with an OPCM given by

$$ (i, x) \boxplus (j, y) := (k, M_k^i(x) \oplus M_k^j(y)) \quad \text{and} \quad 0 := (\perp, 0_{\perp}) $$

where $k = i \vee j$ and $(i, x) \boxplus (j, y)$ is defined if $M_k^i(x) \oplus M_k^j(y)$ is defined.

The above construction is a slight modification of a form of Grothendieck construction for monoidal categories, see [22] for details.

## 5.3 Example: Natural join for relational dataset

Before we show our general result of ordered valuation algebras, we proceed with our simplest example—the possibility representation. The linkage operation $\boxplus$ derived from Theorem 5.4 is the natural join in relational database theory [4].

First of all, we assume that there is a set $\mathfrak{A}$ of known attribute names and a set $\Phi_A$ of values for each attribute $a \in \mathfrak{A}$. For example, $\mathfrak{A}$ may consist of tags for UK postcode, personal information, medical conditions, and so on. By abuse of notation, we denote by $\Phi_A$ for $A \subseteq \mathfrak{A}$ the cartesian product $\Phi_A := \prod_{a \in A} \Phi_a$. Whenever $A \subseteq B$, we have projections $p_{B,A}$ from $\Phi_B$ to $\Phi_A$ which sends $(x_b)_{b \in B}$ to $(x_a)_{a \in A}$. A functor $P$ from the powerset $\mathbb{P}(\mathfrak{A}, \subseteq)$ to $\mathbf{PCM}_{\preceq}$ is defined by

$$ (A \subseteq \mathfrak{A}) \mapsto (\mathbb{P}^{+}\Phi_A, \sqcup, \cap, \Phi_A) \quad \text{and} \quad (A \subseteq B) \mapsto (p_{B,A}^{-1}: \mathbb{P}^{+}\Phi_A \to \mathbb{P}^{+}\Phi_B). $$

In our interpretation, any set $S \in \mathbb{P}^{+}\Phi_A$ is a set of possibilities where only one of them is true, so having more elements in $S$ means less specific information. If $A \subseteq B$, then $p_{B,A}^{-1}(S)$ is merely the set $S$ padded with all combinations, i.e. $S \times \prod_{b \in B-A} \Phi_b$. So, $p_{B,A}^{-1}(S)$ contains no information about attributes $B-A$.
Therefore the ordering on the Grothendieck completion $\int \Phi$

$$ (A, S) \leq (B, T) \iff A \subseteq B \text{ and } S \times \prod_{b \in B-A} \Phi_b \supseteq T $$

simply means that $(A, S)$ is less informative than $(B, T)$ if $(B, T)$ contains more attributes and is more specific on those already known in $A$.

By Theorem 5.4, the derived operation $\boxplus$ is given as $(A, S) \boxplus (B, T) = (A \cup B, S \bowtie T)$ for $A, B \subseteq \mathfrak{A}$, $S \in \mathbb{P}^+(\Phi_A)$, and $T \in \mathbb{P}^+(\Phi_B)$ where

$$ S \bowtie T = \{ x \in \prod_{a \in A \cup B} \Phi_a \mid p_{A \cup B, A}(x) \in S \wedge p_{A \cup B, B}(x) \in T \} $$

which is by definition the natural join in relational database theory.

## 5.4 Ordered valuation algebras

It is observed in the community of approximate reasoning that with two algebraic operations of combination and marginalisation a number of approximating inference techniques can be formalised under reasonable assumptions. The axiomatic approach is pursued by Shenoy and Shafer [21], Shenoy and Kohlas [15], Haenni [10], etc. In this section, we show that a variant of their axiomatic frameworks can be derived by our Grothendieck construction for ordered (total) commutative monoids, clarifying the relationship between our approach and theirs.

The following concept is derived from [10]:

**Definition 5.5.** A (stable) ordered valuation algebra is a two-sorted algebra $(\Phi, \leq, D)$, consisting of a partially ordered set $(\Phi, \leq)$ of valuations and a bounded lattice $D$ of domains with operations

i) $\otimes: \Phi \times \Phi \to \Phi$ called combination,

ii) $d: \Phi \to D$ such that $d(\varphi)$ is called the domain of $\varphi$,

iii) $(-)^{\downarrow-}: \Phi \times D \to \Phi$ called focusing where $\varphi^{\downarrow x}$ is defined for $x \leq d(\varphi)$,

iv) and $e: D \to \Phi$ such that $e_x$ is (called) an identity element

satisfying conditions below. In the following context, $\Phi_x = \{ \varphi \in \Phi \mid d(\varphi) = x \}$.

i) $(\Phi, \otimes)$ is a commutative semigroup.

ii) Comparable valuations are of the same domain: $\varphi \leq \psi$ implies $d(\varphi) = d(\psi)$.

iii) Identity element: $d(e_x) = x$, $e_x \otimes e_y = e_{x \vee y}$, and $\varphi \otimes e_x = \varphi$ for $\varphi \in \Phi_x$.

iv) Stability of identity under focusing: $e_y^{\downarrow x} = e_x$ for $x \leq y$.

v) Labelling: $d(\varphi \otimes \psi) = d(\varphi) \vee d(\psi)$ and $\varphi^{\downarrow x} \in \Phi_x$ if $x \leq d(\varphi)$.

vi) Transitivity of focusing $(\varphi^{\downarrow y})^{\downarrow x} = \varphi^{\downarrow x}$ for $x \leq y \leq d(\varphi)$.

vii) Distributivity of focusing over combination: $(\varphi \otimes \psi)^{\downarrow d(\varphi)} = \varphi \otimes \psi^{\downarrow d(\varphi) \wedge d(\psi)}$.

viii) Combination preserves ordering: $\varphi_1 \otimes \varphi_2 \leq \psi_1 \otimes \psi_2$ whenever $\varphi_i \leq \psi_i$.

ix) Focusing preserves ordering: $\varphi^{\downarrow x} \leq \psi^{\downarrow x}$ for any $x \leq d(\varphi) = d(\psi)$ and $\varphi \leq \psi$.
The focusing operation $\downarrow$ formalises marginalisation in probability theory and projection in relational database theory. The intuitive meaning of every other operation is self-evident. In addition to the focusing operation, a vacuous extension operation, coined in [13], $(-)^{\uparrow y}: \Phi_x \to \Phi_y$ can be defined for every $y \ge x$ via

$$ \varphi^{\uparrow y} := \varphi \otimes e_y $$

We will see that $\downarrow$ and $\uparrow$ form a Galois connection under mild conditions.

**Remark 5.6.** The original formulation in [10] imposes additional requirements. For example, $D$ is only a powerset instead of a lattice and $\Phi_x$ also requires a null (or, absorbing) element which in [10] represents a special inconsistent information. For the sake of brevity, we refrain to discuss these conditions. More variants of (unordered) valuation algebras can be found in [13, 18].

**Proposition 5.7.** Let $(\Phi, \le, D; \otimes, d, \downarrow, e)$ be an ordered valuation algebra. Then, the following statements hold:

i) $(\Phi_x, \le, \otimes, e_x)$ is an ordered commutative monoid.

ii) For any $x \le y$, the vacuous extension operation $(-)^{\uparrow y}$ is an order-preserving monoid homomorphism from $\Phi_x$ to $\Phi_y$.

iii) $(\Phi, \le, D; \otimes, d, \downarrow, e)$ gives rise to a functor from $D$ to the category of ordered commutative monoids.

As we intend to view ordered valuation algebras as Grothendieck completions of families of commutative monoids, an obvious discrepancy is that $\varphi$ and $\psi$ are comparable only if $d(\varphi) = d(\psi)$ in ordered valuation algebras while elements $(x, \varphi)$ and $(y, \psi)$ in $\int P$ are comparable even if domains $x$ and $y$ are different. This can be readily mitigated by extending $\le$ canonically:

$$ \varphi \le' \psi \iff d(\varphi) \le d(\psi) \quad \text{and} \quad \varphi \otimes e_{d(\psi)} \le \psi. $$

**Proposition 5.8.** The ordered algebraic structure $(\Phi, \le', D; \otimes, d, \downarrow, e)$ satisfies the conditions<fnref n="4" /> of ordered valuation algebra except that $\varphi \le \psi$ implies $d(\varphi) = d(\psi)$.

By applying the Grothendieck construction (Theorem 5.4) to the $D$-indexed family of ordered commutative monoids $\Phi_x$ (Proposition 5.7), we have a partially ordered set $(\int \Phi, \preceq)$. The mapping $(x, \varphi) \mapsto \varphi$ is evidently bijective since $d(\varphi) = x$, and $(x, \varphi) \preceq (y, \psi) \iff \varphi \le' \psi$ by definition. That is, the bijection $(x, \varphi) \mapsto \varphi$ is an order isomorphism between $(\int \Phi, \preceq)$ and $(\Phi, \le')$.

It is clear that the domain operation $d: \Phi \to D$ is the projection $p: \int \Phi \to D$ through the isomorphism, i.e. $p(x, \varphi) = d(\varphi)$. Similarly, $e_x \in \Phi_x$ is unique for each $x$, so it defines $e: D \to \int \Phi$.

As for the combination operations $\otimes$ and $\boxtimes$, note that $\boxtimes$ is given by

$$ (x, \varphi) \boxtimes (y, \psi) = (z, \varphi^{\uparrow z} \otimes \psi^{\uparrow z}) $$

<footnote n="4">⁴ The order-preservation property of focusing accordingly becomes ‘if $\varphi \le \psi$ and $x \le d(\varphi)$ then $\varphi^{\downarrow x} \le \psi^{\downarrow x}$.’</footnote>
where $z = x \lor y$ and $\varphi^{\uparrow z} \otimes \psi^{\uparrow z} = \varphi \otimes \psi$ by an easy calculation. Henceforth, $\otimes$ is the same as $\boxtimes$ via the isomorphism.

It remains to derive the focusing operation from the Grothendieck construction.
To this point, we need a regularity condition:

**Lemma 5.9.** For any ordered valuation algebra $\Phi = (\Phi, \leq, D; \otimes, d, \downarrow, e)$, the following statements are true:

i) $\varphi^{\uparrow y} \leq \psi$ implies $\varphi \leq \psi^{\downarrow x}$.

ii) If $e_x \leq \varphi$ for any $\varphi \in \Phi_x$ and $\Phi$ is regular, i.e. for any $\varphi$ and $x \leq d(\varphi)$ there is $\chi \in \Phi_x$ such that $\varphi^{\downarrow x} \otimes \chi \otimes \varphi \leq \varphi$, then $\varphi \leq \psi^{\downarrow x}$ implies $\varphi^{\uparrow y} \leq \psi$.

*Remark 5.10.* The condition(s) in Lemma 5.9 are studied in [18]. Idempotent valuation algebras are called *information algebras* by Kohlas [13].

Every adjoint is uniquely determined by the other adjoint, so in particular
the focusing operation $\downarrow$ is uniquely determined by the vacuous extension $\uparrow$.

To sum up, we have shown that the combination operation $\otimes$ of an ordered valuation algebra can be derived by the Grothendieck construction:

**Theorem 5.11.** Every regular ordered valuation algebra $(\Phi, \leq, D; \otimes, \downarrow, e)$ with $e_x \leq \varphi$ for any $\varphi \in \Phi_x$ is isomorphic to the Grothendieck completion $(\int \Phi, \preceq, \boxtimes, 0)$ of the functor given by Proposition 5.7.

*Remark 5.12.* Both Theorems 5.4 and 5.11 justify our claim that data linkage is made of data combination and changes of domain. The Grothendieck construction is in fact an equivalence of categories so that a pseudo-functor from a preorder to monoidal structures is essentially an opfibration equipped with a global monoidal structure. For interested readers, see [22, Theorem 12.7].

# 6 Concluding remarks

Ubiquitous computing has led to ubiquitous data. Technologies exist that explore information content by combining data in a dataset and, in particular, linking data from different datasets. Given the diversity of what passes for data—exact, approximate, erroneous, fictitious—a very abstract conceptual framework is needed to discover any general principles in today’s *datafest*.

We have presented an abstract algebraic framework based on axiomatic notions that model a data source, data representations and their combination ‘⊕’, a measure of information content ‘≤’, and linkage between data sources. By stripping down intuitions we have found that *ordered partial commutative monoids* provide algebraic structures to be found at the heart of many quite disparate data sharing situations.

Our approach could be developed further using category-theoretic notions which have proved successful in database theory, see e.g., [19]. While databases provide useful examples for our theory, the exact connection remains unclear.

Our next steps are to map the scope of ordered partial commutative monoids
by exploring new and various
i) types of data, especially those in approximate reasoning such as belief func-
tions and those discussed in uncertainty reasoning [11], and so on;

ii) types of operations on and between our algebras.

Returning to our background motivation in the introduction, clearly more atten-
tion needs to be paid to the concept of data privacy and how linkage of data can
lead to privacy breach, e.g., de-anonymisation. This is the subject of ongoing
investigations, cf. [25].

Interestingly, there does not seem to be much of a theory of ordered partial
commutative monoids so that, too, is something to do.

References

1. Arieli, O., Avron, A.: The value of the four values. Artif. Intell. **102**(1), 97–141 (1998). https://doi.org/10.1016/S0004-3702(98)00032-0

2. Attard, J., Orlandi, F., Scerri, S., Auer, S.: A systematic review of open government data initiatives. Gov. Inform. Q. **32**(4), 399–418 (2015). https://doi.org/10.1016/j.giq.2015.07.006

3. Belnap, N.D.: A useful four-valued logic. In: Modern Uses of Multiple-Valued Logic, Episteme, vol. 2, pp. 5–37. Springer Netherlands, Dordrecht (1977). https://doi.org/10.1007/978-94-010-1161-7_2

4. Codd, E.F.: The Relational Model for Database Management: Ver. 2. Pearson (1990)

5. Coecke, B., Lal, R.: Causal categories: a backbone for a quantum-relativistic universe of interacting processes. In: Proceedings of QPL VII. pp. 17–26 (2010)

6. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, 2 edn. (2002)

7. Foulis, D.J., Bennett, M.K.: Effect algebras and unsharp quantum logics. Found. Phys. **24**(10), 1331–1352 (1994). https://doi.org/10.1007/BF02283036

8. Fritz, T.: Resource convertibility and ordered commutative monoids. Math. Struct. Comp. Sci. **27**(06), 850–938 (2017). https://doi.org/10.1017/S0960129515000444

9. Gunter, C.A.: The mixed powerdomain. Theor. Comput. Sci. **103**(2), 311–334 (1992). https://doi.org/10.1016/0304-3975(92)90017-A

10. Haenni, R.: Ordered valuation algebras: a generic framework for approximating inference. Int. J. Approx. Reason. **37**(1), 1–41 (2004). https://doi.org/10.1016/j.ijar.2003.10.009

11. Halpern, J.Y.: Reasoning about Uncertainty. The MIT Press, 1 edn. (2003)

12. Jacobs, B.: Categorical Logic and Type Theory. North Holland, Amsterdam (1999)

13. Kohlas, J.: Information Algebras. Springer-Verlag London, London (2003)

14. Kohlas, J., Pouly, M., Schneuwly, C.: Generic local computation. J. Comput. Syst. Sci. **78**(1), 348–369 (2012). https://doi.org/10.1016/j.jcss.2011.05.012

15. Kohlas, J., Shenoy, P.P.: Computation in valuation algebras. In: Handbook of Feasible Reasoning and Uncertainty Management Systems, vol. 5, pp. 5–39. Springer Netherlands, Dordrecht (2000). https://doi.org/10.1007/978-94-017-1737-3_2

16. Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: *l*-diversity: Privacy beyond *k*-anonymity. ACM T. Knowl. Discov. D. **1**(1), 3 (2007). https://doi.org/10.1145/1217299.1217302
17. Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: 2008 IEEE Symposium on Security and Privacy. pp. 111–125. IEEE (2008). https://doi.org/10.1109/SP.2008.33

18. Pouly, M., Kohlas, J.: Generic Inference. John Wiley & Sons, Inc., Hoboken, NJ, USA (2011)

19. Schultz, P., Spivak, D.I., Wisnesky, R.: Algebraic model management: A survey. In: James, P., Roggenbach, M. (eds.) Recent Trends Algebr. Dev. Tech. WADT 2016, Lecture Notes in Computer Science, vol. 10644, pp. 56–69. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-72044-9_5

20. Scott, D.S.: Data types as lattices. SIAM J. Comput. 5(3), 522–587 (1976). https://doi.org/10.1137/0205037

21. Shenoy, P.P., Shafer, G.: Axioms for probability and belief-function propagation. In: Classic Works of the Dempster-Shafer Theory of Belief Functions, pp. 499–528. Springer Berlin Heidelberg, Berlin, Heidelberg (1990). https://doi.org/10.1007/978-3-540-44792-4_20

22. Shulman, M.: Framed bicategories and monoidal fibrations. Theory Appl. Categ. 20(18), 650–738 (2008)

23. Sweeney, L.: Weaving technology and policy together to maintain confidentiality. J. Law. Med. Ethics 25(2-3), 98–110 (1997). https://doi.org/10.1111/j.1748-720X.1997.tb01885.x

24. Sweeney, L.: *k*-anonymity: A model for protecting privacy. Int. J. Uncertain. Fuzz. 10(05), 557–570 (2002). https://doi.org/10.1142/S0218488502001648

25. Wang, V., Tucker, J.V.: Surveillance and identity: conceptual framework and formal models. J. Cybersecurity 3(3), 145–158 (2017). https://doi.org/10.1093/cybsec/tyx010

26. Wang, Y., Huang, Z., Mitra, S., Dullerud, G.E.: Entropy-minimizing mechanism for differential privacy of discrete-time linear feedback systems. In: 53rd IEEE Conference on Decision and Control. pp. 2130–2135. IEEE (2014). https://doi.org/10.1109/CDC.2014.7039713

27. Wehrung, F.: Refinement Monoids, Equidecomposability Types, and Boolean Inverse Semigroups, LNM, vol. 2188. Springer International Publishing, Cham (2017). https://doi.org/10.1007/978-3-319-61599-8