Görres, Andreas (2022) Termination and Confluence of an Extended CHASE Algorithm. In: ADBIS (Short Papers), Bd. 1652, Springer, 2022.
![[img]](https://eprints.dbis.informatik.uni-rostock.de/style/images/fileicons/text.png) |
Text
Goerres_Adbis22DoctoralConsortium.pdf - Submitted Version Download (198kB) |
Abstract
Many requirements of systems managing and analyzing large volumes of data are interconnected and should therefore be realized together. In this research project, we use a fundamental algorithm of database theory - the CHASE - to address those requirements in a unified manner. While highly expressive, the language of the CHASE is still inadequate to formulate many problems of practical importance. Extending the CHASE with additional features would increase its range of applications, but might jeopardize its key features confluence, safe termination and efficiency. In this work, we demonstrate that calculating basic linear algebra operations with the CHASE is feasible after extending the algorithm with negation and a restricted set of scalar functions. We discuss how confluence and termination of the CHASE are influenced by these extensions.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Forschungsthemen > Anfrageoptimierung Autorenart > DBIS-Publikationen Rahmenprojekte > METIS Forschungsthemen > Provenance Management |
| Depositing User: | Dbis Admin |
| Date Deposited: | 28 Mar 2024 13:15 |
| Last Modified: | 28 Mar 2024 13:15 |
| URI: | https://eprints.dbis.informatik.uni-rostock.de/id/eprint/1106 |
Actions (login required)
 |
View Item |
