Hello Michael,
the graph is used as follows:
- ~10M nodes; ~200M relationships
- Each relationship requires multiple floating properties that can be
considered connecting strength weights. These multiple weights make up a
weight vector - upto ~20 weights per vector
- The weight
Hi Jaroslav,
Although I need more sleep at the moment - your problem seems to have
similar issues to my question about a "query which returns a subgraph"
problem which I've been looking at...
The problem I have with the * operator is that it can is *very* slow.
You also complain that it does redu
I had written up my problem here too:
http://assimilationsystems.com/2016/07/03/assimilation-subgraph-queries/
Here's a thought which occurred to me while sleeping last night...
The two ways I've done it are:
1. shortest paths from initial node set
2. all paths
As noted in the original em
Hi,
I have graph of flights. I want find all flights between two airports
without cycles. How can I clean/disable result of cycles = repeated
sub-paths A-->B-->A-->B.
OK *A-->B-->A*
NOT OK *A-->B-->A-->B*
MATCH path=(source:Airport)-[flights:FLIGHT*]->(destination:Airport)
Thank you for hel
Veesion 2.0.3 is very old and out of support
Any chance that you could update to a recent version like 3.0.4?
Also 2.0.3 doesn't have a page cache, so sth is off.
I think this issue was fixed recently.
>>> Caused by: java.lang.IllegalStateException: Cannot close the PageCache
>>> while file
Hi John,
Do you have more details on the properties that you add as well as your graph
model and queries? Without these details it will be hard to help.
It sounds a bit as if your property heavy relationships might be nodes in
hiding.
Cheers Michael
Von meinem iPhone gesendet
> Am 08.08.20
