SLURP: An Interactive SPARQL Query Planner

Jannik Dresselhaus, Ilya Filippov, Johannes Gengenbach, Lars Heling, Tobias Käfer

Keywords: SPARQL, Query Planning, TPF

TL;DR: SLURP is a Web application for interactive SPARQL query planning that allows to visualize, modify, execute, and analyze the performance of SPARQL query execution plans over Triple Pattern Fragment (TPF) servers.

Abstract:

Triple Pattern Fragments (TPFs) allow for querying large RDF graphs with high availability by offering triple pattern-based access to the graphs.
The limited expressivity of TPFs leads to higher client-side querying and communication costs with potentially many intermediate results that need to be transferred.
Thus, the challenge of devising efficient query plans when evaluating SPARQL queries lies in minimizing these costs.
Different heuristics and cost-based query planning approaches have been proposed to obtain such efficient query plans.
However, we also require means to visualize, manually modify, and execute alternative query plans, to better understand the differences between existing planning approaches and their potential limitations.
To this end, we propose SLURP, an interactive SPARQL query planner that assists RDF data consumers to visualize, modify, and compare the performance of different query execution plans over TPFs.