Prototype translater from a μ-calculus over finite trees to tree automata


Short Version

Reads a SPARQL queries Generates Query Execution Plans Heuristically choose on of the QEP Execute the selected QEP on an RDF graph

Long Version

This page is still under construction ...

μSPARQl manuel


a4μ benchmark

We experimented our prototype against other SPARQL tools. Here are the results. In the figure below, we recapture the theoretical results that, even on simple queries, there are graphs on which our tool has a linear complexity while other approaches have a quadratical complexity.