Hi Igal, Thanks a lot for your answer. I believe you are one of the core developers behind the interesting statefun.
Your suggestion is really nice and as you say, one way is to tailor the graph processing to the philosophy of SF. Though, if one vertex is a stateful function, then heavy hitter nodes in massive graph will become a bottleneck since their functions will do way more computation than other nodes, which have only a few edges. Nevertheless, can the statefun messages be everything? For instance, "its adjacency list" parts of the a vertex/function could be sent as well?? Another way is SF and Flink to way together. Can SF be responsible solely for the messaging of state in a Flink job?? Thanks you in advance. Best, Makis -- Sent from: http://apache-flink-user-mailing-list-archive.2336050.n4.nabble.com/
