A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A distributed vertex-centric approach for pattern matching in massive graphs
2013
2013 IEEE International Conference on Big Data
Graph pattern matching is fundamentally important to many applications such as analyzing hyper-links in the World Wide Web, mining associations in online social networks, and substructure search in biochemistry. Most existing graph pattern matching algorithms are highly computation intensive, and do not scale to extremely large graphs that characterize many emerging applications. In recent years, graph processing frameworks such as Pregel have sought to harness shared nothing clusters for
doi:10.1109/bigdata.2013.6691601
dblp:conf/bigdataconf/FardNRMS13
fatcat:3rphdyjkvfb2fm2wifm7lnazcq