The Theory behind Minimizing Research Data -- Result equivalent CHASE-inverse Mappings

Auge, Tanja and Heuer, Andreas (2018) The Theory behind Minimizing Research Data -- Result equivalent CHASE-inverse Mappings. In: Proceedings of the Conference "Lernen, Wissen, Daten, Analysen", LWDA 2018.

[img] Text
AH18b.pdf - Published Version
Restricted to Registered users only

Download (375kB)
[img] Slideshow
LWDA_Vortrag.key - Presentation

Download (12MB)
LWDA_Poster.pdf - Presentation

Download (834kB) | Preview


In research data management and other applications, the primary research data have to be archived for a longer period of time to guarantee the reproducibility of research results. How can we minimize the amount of data to be archived, especially in the case of constantly changing databases or database schemes and permanently performing new evaluations on these data? In this article, we will consider evaluation queries given in an extended relational algebra. For each of the opera- tions, we will decide whether we can compute an inverse mapping to automatically compute a (minimal) subdatabase of the original research database when only the evaluation query and the evaluation result is stored. We will distinguish between different types of inverses from ex- act inverses to data exchange equivalent inverses. If there is no inverse mapping, especially for aggregation operations, we will derive the nec- essary provenance information to be able to perform the calculation of this subdatabase. The theory behind this minimization of research data, that has to be archived to guarantee reproducible research, is based on the CHASE&BACKCHASE technique, the theory of schema mappings and their inverses, and the provenance polynomials to be used for how provenance.

Item Type: Conference or Workshop Item (Paper)
Subjects: Autorenart > DBIS-Publikationen
Forschungsthemen > Provenance Management
Forschungsthemen > Schemaevolution
Depositing User: Auge
Date Deposited: 05 Dec 2018 07:19
Last Modified: 23 Jun 2020 07:23

Actions (login required)

View Item View Item