Hi Robert,
Thanks a lot for your reply.
1) Now statefun packages are in the MVN repository, so probably they needed
some time to really be included there after your official release.
2) Alinged to the topic of the thread, I am referring to state of massive
graph streams.
To enable distributed graph processing first one needs to partition (in
a specific or random way) the incoming edges to
different processing units which subsequently should:
(a) maintain (initialize and update) the part of the graph's state
they are responsible for as the graph stream evolves
(b) perform computation for answering the distributed graph
processing task.
The (a) part can be done easily with Flink, but (b) probably dictates
accessing partial graph state of one machine from another.
Based on my experience, to do it in Flink one has to implement the
communication among processing units in such a way that is specific to the
graph processing task. So, it would be great to decouple (a) from (b) i.e.,
if Stateful Functions can allow accessing/sending graph state using their
primitives for messaging.
Therefore, my question are the following:
i) is it possible to have Flink jobs that invoke the Stateful Functions
just for state accessing/retrieving/migration??
ii) if yes, how efficient would it be?
iii) if not, can you sketch *proper* way(s) of for state
accessing/retrieving/migration in plain Flink??
Thanks in advance.
Best,
Makis
--
Sent from: http://apache-flink-user-mailing-list-archive.2336050.n4.nabble.com/
