Distributed Evaluation of Graph Queries using Recursive Relational Algebra

TL;DR

This paper introduces Dist-μ-RA, a system for distributed recursive graph query evaluation that enhances expressivity and efficiency, reducing communication costs through tailored evaluation plans, with demonstrated effectiveness on real and synthetic data.

Contribution

It extends recursive relational algebra with distributed evaluation plans, enabling scalable and efficient recursive graph queries.

Findings

Outperforms existing systems in efficiency

Reduces communication costs in distributed settings

Effective on both real and synthetic graphs

Abstract

We present a system called Dist-$\mu$-RA for the distributed evaluation of recursive graph queries. Dist-$\mu$-RA builds on the recursive relational algebra and extends it with evaluation plans suited for the distributed setting. The goal is to offer expressivity for high-level queries while providing efficiency at scale and reducing communication costs. Experimental results on both real and synthetic graphs show the effectiveness of the proposed approach compared to existing systems.