Typed Linear Algebra for Efficient Analytical Querying
Jo\~ao M. Afonso, Gabriel D. Fernandes, Jo\~ao P. Fernandes, Filipe, Oliveira, Bruno M. Ribeiro, Rog\'erio Pontes, Jos\'e N. Oliveira, Alberto J., Proen\c{c}a
TL;DR
This paper introduces a typed linear algebra framework for data representation and analytical querying, combining strong type safety and diagrammatic query expression, validated against TPC-H benchmarks.
Contribution
It presents a novel unified framework using typed linear algebra for data querying, integrating type checking and diagrammatic query specification.
Findings
LA-based approach performs competitively with PostgreSQL and MySQL.
The framework enables strong type safety in analytical queries.
Efficient execution of LA diagram paths demonstrated on benchmark queries.
Abstract
This paper uses typed linear algebra (LA) to represent data and perform analytical querying in a single, unified framework. The typed approach offers strong type checking (as in modern programming languages) and a diagrammatic way of expressing queries (paths in LA diagrams). A kernel of LA operators has been implemented so that paths extracted from LA diagrams can be executed. The approach is validated and evaluated taking TPC-H benchmark queries as reference. The performance of the LA-based approach is compared with popular database competitors (PostgreSQL and MySQL).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.