We present a system called Dist-μ-RA for the distributed evaluation of recursive graph queries. Dist-μ-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.
@article{arxiv.2111.12487,
title = {Distributed Evaluation of Graph Queries using Recursive Relational Algebra},
author = {Sarah Chlyah and Pierre Genevès and Nabil Layaïda},
journal= {arXiv preprint arXiv:2111.12487},
year = {2025}
}