Fast Join Project Query Evaluation using Matrix Multiplication

by   Shaleen Deep, et al.

In the last few years, much effort has been devoted to developing join algorithms in order to achieve worst-case optimality for join queries over relational databases. Towards this end, the database community has had considerable success in developing succinct algorithms that achieve worst-case optimal runtime for full join queries, i.e the join is over all variables present in the input database. However, not much is known about join evaluation with projections beyond some simple techniques of pushing down the projection operator in the query execution plan. Such queries have a large number of applications in entity matching, graph analytics and searching over compressed graphs. In this paper, we study how a class of join queries with projections can be evaluated faster using worst-case optimal algorithms together with matrix multiplication. Crucially, our algorithms are parameterized by the output size of the final result, allowing for choice of the best execution strategy. We implement our algorithms as a subroutine and compare the performance with state-of-the-art techniques to show they can be improved upon by as much as 50x. More importantly, our experiments indicate that matrix multiplication is a useful operation that can help speed up join processing owing to highly optimized open source libraries that are also highly parallelizable.


page 1

page 2

page 3

page 4


Covers of Query Results

We introduce succinct lossless representations of query results called c...

Enumeration Algorithms for Conjunctive Queries with Projection

We investigate the enumeration of query results for an important subset ...

Size bounds and query plans for relational joins

Relational joins are at the core of relational algebra, which in turn is...

Density-optimized Intersection-free Mapping and Matrix Multiplication for Join-Project Operations (extended version)

A Join-Project operation is a join operation followed by a duplicate eli...

Relational E-Matching

We present a new approach to e-matching based on relational join; in par...

The Optimization of Running Queries in Relational Databases Using ANT-Colony Algorithm

The issue of optimizing queries is a cost-sensitive process and with res...

Ranked Enumeration of Join Queries with Projections

Join query evaluation with ordering is a fundamental data processing tas...

Please sign up or login with your details

Forgot password? Click here to reset