[looks like I managed to accidentally delete a previous post of mine to this thread]
Thanks Javier, and thanks Peter for stimulating some discussion on our wiki page.
We are evaluating the viability of Neo4j+Cypher to deal with graph timelines
from wearable proximity sensors, and we would like to think more in general
about representing and querying graph timelines (i.e., time-dependent graphs) in Neo4j.
In experimenting with the data model described in the wiki page,
we faced rather unexpected (for us) performance issues with some Cypher queries,
even on relatively small graphs such as the test data discussed in the wiki.
We are trying to understand whether we should work more on the data model,
on the queries, or whether we're facing intrinsic performance limitations of Neo4j+Cypher
when dealing with highly-connected data.
Thanks in advance for any feedback or insights !
Best, Ciro