  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.
