tinkerpop3 | Blazegraph Tinkerpop3 Implementation

I have an array of usernames (eg. ['abc','def','ghi']) to be added under 'user' label in the graph.

Now I first want to check if the username already exists (g.V().hasLabel('user').has('username','def')) and then add only those for which the username property doesn't match under 'user' label.

Also, can this be done in a single gremlin query or groovy script?

I am using titan graph database, tinkerpop3 and gremlin REST server.

I use TinkerGraph for integration tests (extended unit tests) in Java. In this implementation Edge ids are generated as a sequence of Integers. I want to change that so they are generated as random UUIDs. The reason for this is to get my test setup behave closer to my production graph database. Can I do this in Tinkerpop3 and if so how?

I have found that in Tinkerpop/blueprints (https://github.com/tinkerpop/blueprints/wiki/id-implementation) there existed an IdGraph.IdFactory which seemingly would provide what I need. However as I understand it that is not available for Tinkerpop3.

About to start using ScyllaDB with JanusGraph, and Tinperpop3.

For now, I'll work with <200 gb data, so I want to do everything on my own (xeon based) computer.

My question is mostly: are some versions incompatible with each other?

For ScyllaDB I'd probably go with: https://www.scylladb.com/download/debian9/

But JanusGraph does not list ScyllaDB as (tested and) compatible, although I've read on several places this can be used https://github.com/JanusGraph/janusgraph/releases/tag/v0.2.2

And for Tinkerpop3, I'd go with their latest version 3.3.4 http://tinkerpop.apache.org/docs/current/reference/

I'm trying to do pagination in Gremlin. I've followed the solution provided on gremlin recipes. So right now I am using the range() step to truncate results. This works well because when users asks for x results id only queries for x of them and doesn't perform full search which is significantly faster.

However in Gremlin docs it states that:

A Traversal’s result are never ordered unless explicitly by means of order()-step. Thus, never rely on the iteration order between TinkerPop3 releases and even within a release (as traversal optimizations may alter the flow).

And order is really important for pagination (we don't want user to have same results on different pages).

Adding order() would really slow down querying, since it will have to query all vertices that apply to the search and then truncate it with range().

Any ideas how this can be solved to have consistency between queries and still have smaller query time for not-full search?

im working with the Apache gremlin graph and TinkerPop3. There are two nodes

I start my Gremlin NEO4J like this

I am using TinkerPop3 in Java and I have a weighted multi-graph on which I would like to run Dijkstra algorithm to find Shortest Weighted Path between two vertices. I have found in other questions that the recommended way to do this is by using JUNG with TinkerPop, but they are related to TinkerPop2, which had the JungGraph as part of blueprints.

My questions is whether there is any efficient way to use JUNG on Tinkerpop3 graphs, as the only way I have found for now is to create a new JUNG graph and iteratively add all edges from my TinkerPop3 graph to it. Any alternative suggestions to JUNG are also welcomed.

I'm relatively new to Gremlin, and the company I'm with is looking to implement a graph database with some temporary edges within it. Each vertex could have 1 or more edge, and each edge would have a property on it that is essentially isTemporary true/false.

When traversing the graph, if "isTemporary" = true we should follow that edge, otherwise we should follow the edge where "isTemporary" = false.

I.e.,

A-[isTemporary:true, value 1] -> B

A-[isTemporary:false, value 2] -> C

B-[isTemporary: false, value 3] -> D

Running a single gremlin query should return A->B->D in this case.

I've looked through TinkerPop3 documentation, and it seems like "choose" may be what I want to use here, but all the examples seem to return a value, when what I want is a traversal to come back so I can repeatedly act on the traversal.

Any help would be appreciated.

I'm very new to Gremlin. I have been going through the documentation but continue to struggle to find an answer to my problem. I'm assuming the answer is easy, but have unfortunately become a little confused with all the different API options e.g. subgraphs, side effects and would like a little help/clarity from the expert group if possible.

Basically (as an example) I have a graph that looks like the below where I first need to select 'A' and then traverse down the children of 'A' only, to find if there is Vertex that matches 'A3' or 'A4'.

Selecting the first Vertex of course is easy, I simply do something like: