hello, I want to ask how to be able to index solr and hbase storage, because I tried that the data could only enter hbase but could not index data to solr, I used hbase version 2.1.0, zookeper version

Hi, Can you please send something going wrong that is reproducible? Below you find an example on the latest janusgraph-full-0.5.2 where hasLabel() works fine. marc:/tera/lib/janusgraph-full-0.5.2$

to HadoopMarc: it is not about double quote. the problem is: when gremlin script contains hasLabel() clause, janus server will throws NullPointerException. i use console and gremlin driver to fire

one correction to last post in below line. JanusGraphTransaction tx = graph.buildTransaction().logIdentifier("TestLog").start();

Hi Sandeep, Please see below java code and properties information which I am trying in local with Cassandra cql as backend. This code is not giving me the change log as event which I can get via

Pawan, Can you elaborate more on the program where your are trying to embed the script in? Regards, Sandeep

Never worked with cassandra. Perhaps a base64 encoding is used for storing.

Hey Jason, Same thing happen with my as well where above script work well in gremlin console but when we use it in java. we are not getting anything in process() section as callback. Could you help

Hi, Do you mean that the only difference between the first and the second script is the presence of the closing double quote? I see the stacktrace is from Gremlin Server: did you use Gremlin Console

query with gremlin script: "g.E().hasLabel('L2_LINK').has('prop1', 'prop1-value')" the returned result is expected and correct. but query with gremlin script: "g.E().hasLabel('L2_LINK').has('prop1',

One more thing which i observed is if in the same transaction I try to change the objId property of vertices which has same value for objId, then commit is successful. But if i change the value in

Hi, > why the query is 3x slower on 6 nodes Did you check the hardware differences? Probably the 6-node cluster has slower network, less memory, slower disk, etc. Another possibility that I can think

Hi Manabu, OK, I think for this graph structure your initial query is fine for getting the right output results. Still, to better understand the impact on the performance of using sack() you might

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