A Distributed implementation of GXPath

In the last few years there has been an increasing number of application fields, like the Semantic Web, social networks, bioinformatics, astronomical databases, etc., where large graph datasets are analyzed, queried, and, more generally, manipulated. Graphs are usually queried by specifying reachability patterns through regular path expressions; this leads to the need for efficient and scalable tools for processing 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.