Hi All, https://stackoverflow.com/questions/69454519/generating-efficient-count-query-in-gremlin-for-multiple-scenarios Request you to check the problem posted on StackOverflow and share your feedback

Hi Oleksandr, Thank you for the detailed explanation, regarding the configuration and indexes. I will dig deeper into it and try to resolve the problem. But I think the queries which I am executing ar

Hi All, Updated the Janusgraph version to 0.6.0 and added the parallel execution queries in the configuration files as suggested by Oleksandr. Still, the performance is not improved. I think I am miss

Hi Marc, To avoid confusion, including a new transaction at line number 39, as well as at line no 121. Line 39: GraphTraversalSource g = graph.newTransaction().traversal(); Line 121: g = ctx.g = graph

Hi Marc, The storage backend used is Cassandra. Yes, storage backend janusgraph and load scripts are on the same server. specified storage.batch-loading=true CPU usage is very low not more than 3 perc

Hi All, I have attached a groovy script that I use to load data into janusgraph. The script takes 4 mins to load 1.5 million nodes and 13 mins to load approx 3 million edges. The server on which the s

Laura that is helpful, will go through it and try to implement it. Also, if there are any configurations that can be tuned for better performance, please share them.

Hi Boxuan, Thank you for your response. I am not sure, how I can build janusgraph from the master branch. If you can share step's/procedure to do the same, I can check otherwise need to wait for the n

Hi All, I am using janusgraph for a while. The use case which I am working on consists of 1.5 million nodes and 3 million edges. Prepared a batch loading groovy script. The performance of the data loa

Hi All, The objective is to count the number of nodes and edges. Query: g2.inject(1).union(V().has('title', 'A').aggregate('v1').union(outE().has('title', 'E1').aggregate('e').inV().has('title', 'B'),

I have gone through the commit, I think that will help. To confirm we need to test it with the master branch as it has been not released yet. Earlier, we downloaded the full version from the releases

Hi All, Please take a look at following issue and provide your feedbacks https://stackoverflow.com/questions/67908881/how-to-improve-performance-of-count-query?noredirect=1#comment120034631_67908881 T

Hi Marc, I am using the following query now. g2.inject(1).union( V().has('property1', 'V1').aggregate('v1').outE().has('property1', 'E1').limit(100).aggregate('e').inV().has('property2', 'V2').aggrega

Hi Marc, Thank you for your reply. I will try to report this issue on janusgraph repository. Regarding the work around you suggested, if possible please share the updated query with work around for qu

Hi Marc, This query takes 18 sec to run by changing as to aggregate and select to project. But still, 99% of the time is taken to compute union. There is no memory issue, it already set to 8g. g.injec

Hi Marc, That works as expected. Union also works as expected as in Query1 but when I add limit to all edge the performance degrades. Thanks

Hi Marc, Yes, all the index are made available and no warning is thrown while executing the query. I tried debugging using profile step. 99% of time is taken by the union query. Thanks & Regards, Vina

Hi Marc, Tried the approach you suggested. There is some improvement. Earlier it took 2 mins, now it's taking 1min 50sec. Is there any other way to optimize this further may to ms or seconds?? Thank &

Hi Marc, Thank you for your reply. I understand the queries are big, so there is a problem viewing them. Actually I am not interested in either of v1 or v2. I want to apply limit on edges, and don't c

Hi All, g.inject(1).union(V().has('property1', 'vertex1').as('v1').union(outE().has('property1', 'edge1').as('e').inV().has('property1', 'vertex1'),outE().has('property1', 'edge2').as('e').inV().has('