Hi Marc, Sorry, I forgot an attachment (Image of tree structure). Relationships between vertices and edges are like below. (Label:item, serial:A)<--[Label:assembled,

Hi Manabu, What edge are present between vertices A,B,C,D,E,F? If there are only edges A-B, A-C, A-D, A-E, A-F, you do not need repeat(). Best wishes, Marc Op woensdag 25 november 2020 om 09:22:34

Hi Marc, Thank you for your quick reply. Sorry for the lack of my explanation. I have a graph like below. (There are 3 levels in this figure, but not necessarily 3 levels.) When query by "A" for

Hi Manabu, repeat()/simplePath()/emit() can have valid uses, although normally you combine it with the times() or until() step to limit the number of repeats. The profile from your query suggests that

Hi Boxuan, I created issue #2255, and pull request #2256 with the fix for the issue. Can you please review? Thanks, Madhan From: <janusg...@...> on behalf of BO XUAN LI

Just an additional note, you may have noticed that the profile step above shows a time taken of >1000ms. I do not know why this is the case. When run on the console without profile, it reflects the

Hello, I am currently using Janusgraph version 0.5.2. I have a graph with about 18 million vertices and 25 million edges. I have two versions of this graph, one backed by a 3 node Cassandra cluster

Hi Marc, Thank you for your reply. I'm reading ref docs that you referred about sack()/barrier(). But, I've not able to understand yet. One question. What means this you advised?

Hi Shubhram, I'm trying something similar for reindex and deletion of index with Hbase as backend, were you able to resolve your issue? I'm getting the following error for my function call on

Hi I have multiple indexes in the graph. One of them is on the property objId of the vertex. This index is unique. Even then i can see more than one vertices in the graph with same objId, when i fire

Looks cool, can you submit an issue and a PR? Regards, Boxuan

Hi Manabu, Without knowing if the considerations below will really help, you may try the following: in the current traversal the repeat(), simplePath() and emit() steps have no effect if the children

Hi Boxuan, Attached patch has updated unit test to detect leaked transactions in ConsistentKeyLocker. 14 of 28 tests in ConsistentKeyLockerTest fail due to this issue. Once this bug is

Thanks, I misunderstood the method. 在2020年11月6日星期五 UTC+8 下午9:33:16<HadoopMarc> 写道：

Hi All, I'm testing traversal query performance. My query (please see below) takes about 1.8sec. Is there solution for improve performance (faster than 1.8sec)? I hope that takes less than

Hi Anjani, In a VertexProgram you cannot read properties from neighbouring vertices using the ComputerAdjacentVertex. You have to pass data between vertices explicitly using the messenger object in

Hi All, In our graph, related nodes are connected to a master node. So as part of vertex program i was thinking to just get all master nodes and from master node get all connected nodes. So finally

Thanks Marc! I just posted the GitHub issue https://github.com/JanusGraph/janusgraph/issues/2251

Hi, I can reproduce this for linux. So, please, create the issue on github with the text above. Thanks, Marc Op zondag 15 november 2020 om 08:36:45 UTC+1 schreef ba...@...:

I was about to open an issue on GitHub. But I saw a message that asks me to post here first. The .bat and .sh files under the "janusgraph-0.5.2/bin" folder give errors when you try to run them from a