Abstract
Query planning is essential for graph query execution performance. In distributed graph processing, data partitioning and messaging significantly influence performance.
However, these aspects are difficult to model analytically, which makes query planning especially challenging. This paper introduces scouting queries, a lightweight mechanism to gather runtime information about different query plans, which can then be used to choose the "best" plan.
In a pipelined, depth-first-oriented graph processing engine, scouting queries typically execute for a brief amount of time with negligible overhead. Partial results can be reused to avoid redundant work.
We evaluate scouting queries and show that they bring speedups of up to 8.7x for heavy queries, while adding low overhead for those queries that do not benefit.