Typed Linear Algebra for Efficient Analytical Querying

09/03/2018
by   João M. Afonso, et al.
0

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).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2018

Answering Analytical Queries on Text Data with Temporal Term Histograms

Temporal text, i.e., time-stamped text data are found abundantly in a va...
research
03/26/2021

One Algorithm to Evaluate Them All: Unified Linear Algebra Based Approach to Evaluate Both Regular and Context-Free Path Queries

The Kronecker product-based algorithm for context-free path querying (CF...
research
04/20/2020

Taming the Expressiveness and Programmability of Graph Analytical Queries

Graph database has enjoyed a boom in the last decade, and graph queries ...
research
07/27/2023

Evaluating Regular Path Queries on Compressed Adjacency Matrices

Regular Path Queries (RPQs), which are essentially regular expressions t...
research
06/24/2020

Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems

We consider the general problem of learning about a matrix through vecto...
research
08/26/2020

MAR: A structure-based search engine for models

The availability of shared software models provides opportunities for re...

Please sign up or login with your details

Forgot password? Click here to reset