Abstract
AbstractMany 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.KeywordsCHASEData science pipelineTerminationConfluenceEfficienyRelational algebraLinear algebraNegation
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
