A Distributed Implementation of GXPath.
Maurizio Nolé, Carlo Sartiani · 2016
In the last few years there has been an increasing num-ber of application fields, like the Semantic Web, social net-works, bioinformatics, astronomical databases, etc., where large graph datasets are analyzed, queried, and, more gener-ally, manipulated. Graphs are usually queried by specifying reachability patterns through regular path expressions; this leads to the need for efficient and scalable tools for process-ing regular path queries on large graphs. In this work we present a distributed implementation of GXPath and show that this implementation, built on top of Hadoop MapReduce, can scale linearly with the number of vertices and/or edges. 1.