I am trying to replace coalesce() by or() which is generally faster, but there is a problem with or() step failing in the following mum() step: gremlin> graph3 = TinkerGraph.open() ==>tinkergraph[vert

It may work as well, to count totals of all in and out edges for "A" label: g.V().hasLabel('A').union( __.count(), __. outE().count(), __.inV().count() )

Global indexes can be limited to the "constraint" by indexOnly() step, from JanusGraph documentation: mgmt.buildIndex('byNameAndLabel', Vertex.class).addKey(name).indexOnly(god).buildCompositeIndex()

Thank you, Index class is having tx() transaction description, but I have not found it there as well, I have added these comments to 1163 as suggested. Regards, CM

Works like a charm, thank you Bo Xuan Li.

I guess, building composite index for 'title' property will do the job of accessing title(V1) and title(V2) fast, without full scan of DB as currently does. cheers, CM

Thank you Ted, I am also interested in watching this video on OLAP later, it is like 00:30 in Melbourne, not too easy to get up in the morning... Regards to presenters, Christopher.

We have fully integrated our backend with JS:0.6 as recommended, including DB connection using new driver: GraphBinaryMessageSerializerV1. All seams o work as before, except: GraphTraversal<Vertex, ?

Thank you Marc, I was able to reproduce your sample by console: :remote connect tinkerpop.server conf/remote.yaml session # it is GryoMessageSerializerV3d0 - no problem here, but must have serializeRe