Hi, Have you added the janusgraph-inmemory dependency in your pom.xml file? <dependency> <groupId>org.janusgraph</groupId> <artifactId>janusgraph-inmemory</artifactId>

Hi folks i have updated janusgraph version from 0.4.1 to 0.5.2. all my previous unit testcases with inmemory config throws expection below. should i want to add any more particular dependency to my

Thanks for improving it! Always good to learn more.

And here a small variation without the keys and with some code formatting: g.V().as('a').outE().as('e').inV().as('b'). group().by( union(select('a').values('organization'),

Vishu, This may not be optimal, but seems to

Hi Assaf, I am not familiar with GKE but I can try to answer some of your questions: > how does a traversal behave when looking up based on an index key when the key is not yet indexed Assuming the

You can try to use composite index for checking mixedindex delay четверг, 17 декабря 2020 г. в 13:16:43 UTC+3, Assaf Schwartz:

Could this be related to delays in indexing? I don't know how to figure out of such exists, but assuming this happens - how does a traversal behave when looking up based on an index key when the key

From time to time, usually after setting up a fresh copy of the BT and Janus, I'll encounter errors relating to locking. However this doesn't happen every time. Sorry, I can't see to be able copy the

Hi All, I'm experiencing an issues with running JanusGraph (on top of GKE) against BigTable. This is the general setup description: We are using a single node BigTable cluster (for development /

Thank you very much, I'll try that. Toom.

We use special strategy that rewrite order comparator for supporting missing values https://gist.github.com/mad/6bef960d51d7a0d89a8c310851023303 пятница, 4 декабря 2020 г. в 09:59:13

Hello, I request your help regarding the janus graph query which I am trying to construct. Let's consider the following graph where each vertex denotes a person and the edge between any two vertex

Hi Anton, To compare objects you need the eq() predicate, not the is() step (see https://tinkerpop.apache.org/docs/current/reference/#a-note-on-predicates). Also note that JanusGraph uses

Thanks for your explanation. I got the idea, that "many" side of "one-to-many" relationship should go first when adding edges.

Thanks for reply. In real query I don't have an ID, that's why I use traversal in where clause. Tried this one, but it does not work either:

Hi Marc, Thank you for your too much advice. I will keep learning about Gremlin query for better performance. Thanks a lot! Manabu. 2020年12月11日金曜日 22:40:21 UTC+9 HadoopMarc:

Marc is correct about "It is not a bug: the addE() step only adds one edge per traverser". I think query by Mark will create a self link. Below query might work (not

Try g.V(41099392).outE('LINK').where(inV().hasId(110792))

Hi Anton, It is not a bug: the addE() step only adds one edge per traverser. Also, using g.V() twice is an anti-pattern. Try it the other way around, something like (not