A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Combining Vertex-Centric Graph Processing with SPARQL for Large-Scale RDF Data Analytics
2017
IEEE Transactions on Parallel and Distributed Systems
Modern applications require sophisticated analytics on RDF graphs that combine structural queries with generic graph computations. Existing systems support either declarative SPARQL queries, or generic graph processing, but not both. We bridge the gap by introducing Spartex, a versatile framework for complex RDF analytics. Spartex extends SPARQL to combine seamlessly generic graph algorithms (e.g., PageRank, Shortest Paths, etc.) with SPARQL queries. Spartex builds on existing vertex-centric
doi:10.1109/tpds.2017.2720174
fatcat:yolgu6hg75fixgtffmmew57kle