Hi, I do need to traverse it but was hoping it would get chunked/streamed in. Or is there a better way for streaming/lazy loads?

Hi Mathew, I don't know what it does underneath. But if you want to just check about edge existence with hasNext, Can you try with limit 1. g.V(n).inE(e).limit(1).hasNext() Let's see, Amiya

Hey folks, I have a Vertex v who has about 7m+ incoming edges e. The following query takes about 30+ seconds on a local installation of

Duly noted. I'll keep in mind to dig deeper when seeing closed issues mentioning Tinkerpop updates. Thanks everyone!

Yes, exactly. This was a breaking change in TinkerPop 3.5.0 which is included in JanusGraph 0.6.0: https://tinkerpop.apache.org/docs/current/upgrade/#_anonymous_child_traversals Von:

Yes. In JanusGraph 0.6.0, Apache TinkerPop was upgraded to 3.5.1 and requires using an anonymous traversal in such cases. This is mentioned in their "Upgrade for users" guide here:

Ahh I see, I guess this is the intended usage now? Basically doing "__.V" instead of "g.V" for the child traversal?

When running with 0.5.2 I was able to do this traversal to add an edge between to vertices But when doing it through 0.6.0 I get this now: After fiddling with it though I noticed I was able to do

Hi Pawan, Interesting, I could not find a JanusGraph unit test for this basic scenario (there is one with two instances and an index, though). This needs more investigation. Meawhile, are you sure

Thanks for the clarification. That makes sense. I suppose if there were multiple edges from V(h) to V('mother') I would need to qualify it to insure the path exists? eg

Hi Mathew, Both of the example shows 2 different types of default index. g.V(h).out('mother') - This is example for default vertex-centric indexes per edge label - This will help to traverse specific

Hi Amiya, I saw that but wasn't quite sure the intent given the example. It talks about edge labels but the examples are vertices & values? g.V(h).out('mother') -> returns a vertex

Hi Mathew, As per the below Note from Janusgraph docs, even if company is having 1k different types of edge related to it, traverse by edge lable will be fast. Such as find employees employedBy (edge

Hi Matthew, It would be possible to replace the employedBy, isSoldby, isLeasedBy relations with a relatedToCompany relation with employment, selling and lease properties. But I do not see any

Hi, I am trying to build a triplestore ontop of JG. The general model is: Vertex (subject or object) Properties: Label Value (IRI, Literal) - indexed Edge (predicate) Properties: Label

Hi Marc, Thanks for your suggestion, However I am testing it on a local environment having a single replication factor. I believe if the replication factor is one then in all cases it should give me

The JanusGraph Technical Steering Committee is excited to announce the release of JanusGraph 0.6.1. JanusGraph is an Apache TinkerPop enabled property graph database with support for a variety of

Hi Tendai, "Not serializable" sounds as if you pass a JanusGraph instance from the Spark driver to the executor. The function that runs on the Spark executor should call some static function on the

Hi Marc, Thanks for the feedback and suggestion. We investigated applying the JanusGraphFactory inside a singleton object as you've suggested, but ran into the issue that the JanusGraphFactory is not

Hi Pawan, You are right, if issues already arise without index, you should investigate that first, even though a large graph without indices is useless in itself. See the third question from Boxuan Li