Re: [TinkerPop] VertexQuery in Tinkerpop3

19 views
Skip to first unread message

Stephen Mallette

unread,
Jan 17, 2017, 11:56:25 AM1/17/17
to Gremlin-users
Graph Providers will typically write TraversalStrategy implementations to optimize traversals:


You can see TinkerGraph for an example:


Note how it replaces the GraphStep with a TinkerGraphStep which basically enables TinkerGraph's indexing to work (i.e. take has() in the traversal and use its property for an index). You found TinkerCountGlobalStep - note that this step gets injected by a separate strategy called TinkerGraphCountStrategy:


If you have specific questions for how strategies work or how to do a particular optimization please let us know.

On Thu, Jan 12, 2017 at 1:45 PM, NQuinn <nickqu...@gmail.com> wrote:
Previously, in Tinkerpop2, we were overriding VertexQuery to implement some optimized functionality. Now that we are working with Tinkerpop3, we are trying to figure out how to re-implement the same functionality in an AbstractStep. I am not sure how to retrieve the same information: vertex, edge labels, and direction from the previous path steps. I found the TinkerCountGlobalStep in the Apache Tinkerpop repo, but it doesn't seem to use this information.  Can you give me some advice?  Thanks so much! 

--
You received this message because you are subscribed to the Google Groups "Gremlin-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to gremlin-users+unsubscribe@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/gremlin-users/5ca6a543-2436-401b-b7d6-05494ee29cc4%40googlegroups.com.
For more options, visit https://groups.google.com/d/optout.

Reply all
Reply to author
Forward
0 new messages