We provide a model describing data transformation workflows on tables constructed from first principles, namely by defining datasets as structures with functions and sets for which certain morphisms correspond to data transformations. We define rigid and deep data transformations depending on whether the geometry of the dataset is preserved or not. Finally, we add a model of concurrency using meet and join operations. Our work suggests that algebraic structures and homotopy type theory provide a more general context than other formalisms to reason about data cleaning, data transformations and their provenance.
|Published - 2020
|12th International Workshop on Theory and Practice of Provenance, TaPP 2020 - Virtual, Online
Duration: Jun 22 2020 → …
|12th International Workshop on Theory and Practice of Provenance, TaPP 2020
|6/22/20 → …
ASJC Scopus subject areas
- General Computer Science