Hey,
> just to be clear, Would it be safe to say that the compile time for
>
> g.v(0).out.out >> -1
>
> would be slower than
>
> g.v(0).out().out() >> -1
>
> and slower than
>
> g.v(0).outE().inV().outE().inV() >> -1
The fastest would be g.v(0).out().out().
> It is also surprising that the compile times that you have are an order of
> magnitude greater for the the condensed notation. thanks for the info.
The reason why there is a difference in speed is because Groovy's dynamic
programming is based on Java reflection which is slow. However, compiling a
pipeline is the least of your time relative to evaluating your traversal.
We are currently working on Gremlin_scala and Gremlin_jython. Gremlin_scala
provides a nearly identical syntax with anonymous functions (e.g.
filter(_.getProperty("age") > 10)) and so, for many, this might be the way to
go as its much faster with static typing and none of the runtime dynamic
programming techniques used by Groovy. In essence, we plan for the future of
Gremlin to be a graph traversal specification with implementations in multiple
JVM languages so developers can pick which ever host language (JRuby, Groovy,
Scala, Jython, Clojure, etc.) makes them happiest when traversing graphs in the
Gremlin-esque style.
Hope that is clear,
Marko.
http://markorodriguez.com
_______________________________________________
Neo4j mailing list
[email protected]
https://lists.neo4j.org/mailman/listinfo/user
