Hi, I'd suggest a graph database for that job - like neo4j. I never used one before, but it seems like the perfect job for a graph db.
Regards Pascal Von: Phil Hoy <p...@dctfh.com<mailto:p...@dctfh.com>> Antworten an: "user@giraph.apache.org<mailto:user@giraph.apache.org>" <user@giraph.apache.org<mailto:user@giraph.apache.org>> Datum: Montag, 18. November 2013 11:04 An: "user@giraph.apache.org<mailto:user@giraph.apache.org>" <user@giraph.apache.org<mailto:user@giraph.apache.org>> Betreff: subGraph clustering maybe Hi, We have graph data such that subsets of edges and vertexes occur multiple times in the same configuration however these sub graph matches occur rather infrequently. Would Giraph be a good tool to find these subsets, if so how would one go about implementing the algorithm? Phil
