is it maybe faster to do it with cipher?
start n = node:idx("MyID:(1 2 3 1 1500)"),
m = node:idx("MyID:(1 2 3 1 1500)")
MATCH p=(n)-[r:RELATED_TO]-(m)
RETURN p
or 2 find the best between 2 pairs?
thank you.
On Monday, May 26, 2014 10:15:45 AM UTC+3, natali
hey'
i have a db with 300,000,000 relations and 20,000,000 nodes
and i have a group of 100 nodes that i wanna find the relation between this
nodes and create from it a sub graph,
how can i do it with java api?
(find path only works between 2 nodes)
thank you.
--
You received this message becau
hey,
i have a graph with 300,000,000 relations
and 20,000,000 nodes
the user wants to give me a list of 200 nodes (not necessarily connected)
and wants we to classify them into 4 groups that are most connected
can i do it neo4j? how do u suggest to do it?
u read in earlier post its not recommende