You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Neo4j
Dear Friend
In my graph database I have a specific relationship's type that it
calls REFER. I want to write a Query that return all node which REFER
is its outgoing relationship.
please advice me.
Luanne Coutinho
unread,
Apr 8, 2012, 11:51:37 PM4/8/12
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to ne...@googlegroups.com
You could set your start to all nodes: start n=node(*)
but honestly that may not really be the most efficient. Are your nodes not linked to some known starting point, even indirectly?
Maybe you can share your use case in more detail?
Emil Dombagolla
unread,
Apr 9, 2012, 12:52:38 AM4/9/12
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to ne...@googlegroups.com
Hi ,
at least if you have reference ( Starting node for the graph /root node )node for your database , then you can query relationships matching to your type until end of the graph. you can index the nodes to take as a staring node for your query.
Hope this give you some idea.
thushanga.
-- Emil Dombagolla,
Mahdi Negahi
unread,
Apr 9, 2012, 1:29:06 AM4/9/12
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to Neo4j
Thanks for your replies.
I have reference node in my graph database. in addition, it is related
to purpose node indirectly.
(n0) --> (n1) -->...-> (n) -[REFER]-> (n+1)
(n+1) is my desire node that i want to find it, but in my database
this kind of node is more than 1. I think the best way to index these
nodes.
Michael Hunger
unread,
Apr 9, 2012, 6:05:34 AM4/9/12
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to ne...@googlegroups.com
start start=node(0) match start-[*]->()-[:REFER]->end return end
Depending on the size of your graph start n=node(*) match ()-[:REFER]->n return n
Or you index the nodes or the REFER rels and look them up in the index.