Tags:Datalog, Dynamic Programming, Graph Databases, Provenance, Semirings and Transportation Networks
Abstract:
We establish a translation between a formalism for dynamic programming over hypergraphs and the computation of semiring-based provenance for Datalog programs. The benefit of this translation is a new method for computing the provenance of Datalog programs for specific classes of semirings, which we apply to provenance-aware querying of graph databases. Theoretical results and practical optimizations lead to an efficient implementation using \textsc{Soufflé}, a state-of-the-art Datalog interpreter. Experimental results on real-world data suggest this approach to be efficient in practical contexts, competing with dedicated solutions for graphs.
Efficient Provenance-Aware Querying of Graph Databases with Datalog