I have a class with one String field to hold a query string and one for a
compiled query which is created in the constructor. So, each instance has
the query string (for documentation purposes) and the compiled query.
Does CypherParser return the same Query instance for parse()'s with
indentical
Still couldn't find a solution. Do I have to go back to the API to follow a
defined path of relations until the next one is not available or the desired
end node type is reached?
--
View this message in context:
I was afraid that this happened, because in the mail I got from the list
containing my own post the query was missing as well. It was enclosed in raw
text tags. Seems to be a bug in the forum software. Here is the query:
START a=node:nodeIndex(_simpleType = 'something')
MATCH path =
Ah, I didn't see the obvious :-)
Thanks a lot!
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Cypher-syntax-for-conditional-path-segments-tp3551867p3557378.html
Sent from the Neo4j Community Discussions mailing list archive at Nabble.com.
The query
works fine for all *complete* paths. Now I would like to get all incomplete
paths as well, meaning
all a without any BASED ON, all a-[:BASED_ON]-b without CALLS and so on.
Is this possible using cypher? Optional relationships result in null
relations, which cypher does not like when
Once I find the time to set up a blog, I'l happily do that.
What's still annoying me is that I do not understand the difference between
the query pairs 7/8 and 9/10 ...
--
View this message in context:
Thanks for all the replies. To explain what I am doing: I'm harvesting
information from the software engineering tool some guys here are using:
Excel (gawk!). Excel sheets are parsed and converted to graphs,
incrementally enriched with properties as I digest subsequent sheets so that
at the end I
Hi all,
I have three kinds of nodes A, B and C. Both type A and B (distinguished by
a property) have a relationship of the same type to node type C. I want to
find nodes C which have a relationship to A but not to B.
The only idea I came up with is to have a query return all A nodes having a
Good point. I'd believe that thinking of a single node as a degenerated path
wouldn't be that wrong either. However, even returning just the callee
(which is what I wanted anyways) brings no relief, with the relationship
direction having no influence:
08:42:33,150 GraphQuery.java 81 INFO -
Stupid me. Sorry. I should have copypasted your query. Yes, without the path
assignment it works.
Thanks a lot!
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Cypher-question-tp3479960p3482176.html
Sent from the Neo4j Community Discussions mailing list
Hi all,
Being a newbie to neo4j/Cypher, didn't come to a solution myself, so I try
it here: how can I query for a set of nodes which have no incoming relation
of a specific type? Something like
START callee=node:node_auto_index('type:*Service') MATCH
p=(caller)-[:CALLS]-(callee)
RETURN p
Thanks Andres!
I already tried the optional relationship thing, but not the WHERE clause.
However, there is a problem which I have with or without the WHERE (I'm
using neo4j 1.5M02):
START callee=node:node_auto_index('type:*Service') MATCH
p=(caller)-[r?:CALLS]-(callee) WHERE r IS NULL RETURN p
Reversing resulted in the same exception, so I'll try and get the latest
snapshot. Thanks a lot for your help!
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Cypher-question-tp3479960p3480016.html
Sent from the Neo4j Community Discussions mailing list
Downloaded 1.5-SNAPSHOT (two times: the windows community and enterprise
flavor). No change, no matter if the relation points back or forth.
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Cypher-question-tp3479960p3480184.html
Sent from the Neo4j
14 matches
Mail list logo
