Related papers: Matching, Merging and Structural Properties of Dat…
The variety of data is one of the important issues in the era of Big Data. The data are naturally organized in different formats and models, including structured data, semi-structured data, and unstructured data. Prior research has…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
The relational model is the most commonly used data model for storing large datasets, perhaps due to the simplicity of the tabular format which had revolutionized database management systems. However, many real world objects are recursive…
This paper investigates modal type theories by using a new categorical semantics called change-of-base semantics. Change-of-base semantics is novel in that it is based on (possibly infinitely) iterated enrichment and interpretation of…
In this work, we propose trait-based merge trees a generalization of merge trees to feature level sets, targeting the analysis of tensor field or general multi-variate data. For this, we employ the notion of traits defined in attribute…
We show that contrary to appearances, Multimodal Type Theory (MTT) over a 2-category M can be interpreted in any M-shaped diagram of categories having, and functors preserving, M-sized limits, without the need for extra left adjoints. This…
Matching dependencies (MDs) were introduced to specify the identification or matching of certain attribute values in pairs of database tuples when some similarity conditions are satisfied. Their enforcement can be seen as a natural…
We study the algebraic properties of binary relations whose underlying digraph is smooth, that is has no source or sink. Such objects have been studied as surjective hyper-operations (shops) on the corresponding vertex set, and as binary…
In this survey, we provide an overview of category theory-derived machine learning from four mainstream perspectives: gradient-based learning, probability-based learning, invariance and equivalence-based learning, and topos-based learning.…
Motivated by viewing categories as bimodule monoids over their isomorphism groupoids, we construct monoidal structures called plethysm products on three levels: that is for bimodules, relative bimodules and factorizable bimodules. For the…
polyDB is a database for discrete geometric objects. The database is accessible via web and an interface from the software package polymake. It contains various datasets from the area of lattice polytopes, combinatorial polytopes, matroids…
Spurred by a number of recent trends, we make the case that the relational database systems should urgently move beyond supporting the basic object-relational model and instead embrace a more abstract data model, specifically, the…
In this paper, we propose Multi-Modal Databases (MMDBs), which is a new class of database systems that can seamlessly query text and tables using SQL. To enable seamless querying of textual data using SQL in an MMDB, we propose to extend…
Recent work in set theory indicates that there are many different notions of 'set', each captured by a different collection of axioms, as proposed by J. Hamkins in [Ham11]. In this paper we strive to give one class theory that allows for a…
Monads in category theory are algebraic structures that can be used to model computational effects in programming languages. We show how the notion of "centre", and more generally "centrality", i.e. the property for an effect to commute…
There are significant benefits to serve deep learning models from relational databases. First, features extracted from databases do not need to be transferred to any decoupled deep learning systems for inferences, and thus the system…
Let M be a bicomplete, closed symmetric monoidal category. Let P be an operad in M, i.e., a monoid in the category of symmetric sequences of objects in M, with its composition monoidal structure. Let R be a P-co-ring, i.e., a comonoid in…
The main result of this paper is the construction of a trace and a trace pairing for endomorphisms satisfying suitable conditions in a monoidal category. This construction is a common generalization of the trace for endomorphisms of…