That may be a good solution, because you could not treat such a path (if it
were to have null in it somewhere) in a normal fashion anyway.
2011/11/15 Andres Taylor
> I just realized the obviousness of the truth.
>
> The optional bit is viral - it spreads out if it can. So, a path pointing
> to a
I just realized the obviousness of the truth.
The optional bit is viral - it spreads out if it can. So, a path pointing
to an optional relationship, is it self optional. Just like nodes hanging
from an optional relationship are also optional.
So, if the path happens to have any null parts, the who
>
> What version of Neo4j are you using? This query is valid syntax for 1.4.x
> and 1.5.M01.
>
> I'm using version 1.4.1
> Later you would want to use:
>
> > start a=node:nodeIndex(identifier='0') return a
>
> I tried that and got the error:
org.neo4j.cypher.SyntaxException: `<' expected but `n'
Hi all,
Rickard Öberg just blogged about the Cypher Java DSL, I think it's very
interesting reading and will be part of 1.6 hopefully. Feedback very
welcome!
http://rickardoberg.wordpress.com/2011/11/14/creating-a-dsl-for-cypher-graph-queries/
Cheers,
/peter neubauer
GTalk: neubauer.peter
Thanks Petar,
will get on it as soon as I have time. Good contribution!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
http://www.neo4j.org
Hi Peter,
thanks for the swift response. Just a quick question about the ShortestPath
path finder -- does it return paths of only the same (shortest) length or
does it sort all simple paths according to their length. I am almost
certain it does the former, but if it's the latter then that's exactl
Hi there,
I'm having performance issues with Neo4J while using GraphAlgoFactory to
find a path between two nodes. I want to calculate the cost between the two
nodes (each relation type has a different cost), with the maximum depth of
3 (paths with more length can be discarded). I'm using the findA
Mmh,
there is an implementation for this in
https://github.com/neo4j/community/blob/master/graph-algo/src/main/java/org/neo4j/graphalgo/GraphAlgoFactory.java#L93if
that is what you want, we then should expose this as part of the REST
API right?
What REST call are you using right now? Please raise
Done.
https://github.com/neo4j/gremlin-plugin/commit/d19a16b596ee00f89bf18a2f722d3735b229d290
Thanks for pointing this out!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http:
***
Hi Everyone,
Events this week!
Remember, check back to http://plancast.com/neo4j for updates..
**
*San Francisco Tutorial | A Programmatic Introduction to Neo4j *
Monday, 14 November 2011*
*
This tutorial covers the core functionality from the Neo4j graph
Hi guys,
I have a decent size graph (2.5M nodes, 8M relationships) and am interested
in finding paths between two nodes. I am using the REST API since the app I
am working on is developed in .NET.
Due to the nature of the graph the paths can be quite long, so I am using 8
for the max depth parame
Hi Effy,
>From how you describe the model you've created, I don't think it's
structured very well to help you perform the kind of queries you're looking
for.
It looks like you have a single tree with "products" as the root. This
single tree structure means that there is no way to navigate between
Hello,
> Any information to load OWL specifications into Neo4J or guidance to design
> algorithms (managment of temporary data is the blocking point)?
When you use the OpenRDF SAIL bindings provided by TinkerPop, you will be able
to use OpenRDF's OWL reasoners and other tools. Basically, the sta
Ahh,
Will then change the docs to reflect this.
On Nov 14, 2011 5:35 PM, "Marko Rodriguez" wrote:
> Hey Kevin,
>
> > g.v(293).in.drop(5).take(5)
> >
> > and
> >
> > g.v(293).in[5..9]
> >
> > (Both return the same, correct result set)
> > I will be doing some performance tests today on the two, bu
Hey Kevin,
> g.v(293).in.drop(5).take(5)
>
> and
>
> g.v(293).in[5..9]
>
> (Both return the same, correct result set)
> I will be doing some performance tests today on the two, but last week when
> I tried them both on fairly heavy queries, the second method seemed faster
> (I only say "seemed"
Hi,
I've trying to use Neo4j to simulate a graph database I need to create for a
website I'm working on (currently running on SQL server).
I created a bulk loading scripts and generated data (~100K nodes, ~120K
properties, ~120K relationships, 2 relationship types).
While running a simple trave
Mmh,
this is a design issue of passing index-specific queries and
parameters into an index. Mattias or anyone else, do you have any
thoughts on how to expose that better? If you have some ideas, maybe
you can raise an issue for a feature and suggest some approaches?
Cheers,
/peter neubauer
GTalk
I've tried Gremlin but am not finding the syntax very friendly. Is this
'withinDistance' spatial index query possible with Gremlin?
--
View this message in context:
http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-Using-Webadmin-Console-to-Execute-Spatial-Cypher-Query-tp3500531p3506
Kevin,
intuitively your conclusion sounds sound right. The in()[..] is
probably collecting into a Groovy array, and drop().take() are two
more pipes doing stuff, which is probably more expensive than a simple
array oparation. OTOH, I think the pipes are lazy, so you are not
running out of memory wi
Great Anders,
feel free to comment on the manual if you have other remarks!
Cheers,
/peter neubauer
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
http://www.neo4j.org
Never mind, I got it working.
FYI for other ppl: It is possible. Just add the 3rd line to the configuration
file as described in the documentation (link is given in previous message),
start your server with your plugin, and then connect from e.g. Eclipse. Works
like a charm!
From: andli...@hotm
Hi all,
What's the best way to debug a server plugin you've written?
I saw something about debugging the server in the documentation
(http://docs.neo4j.org/chunked/1.5/server-debugging.html), but I don't know if
this applies to plugins as well, or how I could do that.
Any help is appreciated!
Th
hi folks
I'm implementing paging in a gremlin query - Can anyone tell me the
difference(s) between the following two techniques:
g.v(293).in.drop(5).take(5)
and
g.v(293).in[5..9]
(Both return the same, correct result set)
I will be doing some performance tests today on the two, but last week w
23 matches
Mail list logo