I did comm at the end: graph.tx().commit() graph.close

All graph mutations are realized within a (hidden) transaction. You have to commit() the transaction before the changes are visible to other clients. So, look for .commit methods in the gremlin-scala

I am using gremlin-scala. I connect to remote janus server that forked cassandra using: val conf = new BaseConfiguration() conf.setProperty("storage.backend",

Hi ... The gremlin-scala client looks great and uses scala 2_12, indeed. Apart from using gremlin-scala you can import the tinkerpop java libs directly from scala, but this will give you an occasional

A single thread is doing all CRUD operations, it commits after roughly every 10,000 element touches. Could the number of deltas in the transaction be too large?

I think I am iterating all the results but I'm not certain. I looked through my traversal code and categorized it into one of these three. a) Most of my traversals end with toList() or iterate(), such

Are you iterating your results all the way out? Robert Dale

Looks like you can set a batch size, and the default is 20. Let us know if it helps. storage.cql.batch-statement-size=20 Related reading on the Cassandra Java Driver FAQ.

I'm trying out the new storage.backend=CQL with cassandra from the master branch (0.2.0) and I'm consistently hitting this error after a few hours of CRUD operations, which could previously be handled

Re: visualization: you can use Gephi or Cytoscape (both open source). In addition, several commercial graph visualization vendors are working on integrations with JanusGraph that will be announced in

Not speaking for the roadmap... 1. Usually it takes a trivial amount of groovy to parse csv and add the nodes 2. You can point this at a Gremlin server: https://github.com/bricaud/graphexp Robert

I don't know how to write Scala code, so you'll always have to convert my code snippets from Java to Scala ;). Again, the snippet assumes, that all vertices on a certain path have a num value greater

There are several existing graph db benchmarking frameworks, e.g., https://github.com/socialsensor/graphdb-benchmarks — supports several graph dbs, including Titan; should be updated to support

That didn't compile. I changed it to use Key: .repeat(_.outE().inV().has(Key[Long]("num"),gt(50)).simplePath()) oddly enough it filters everything although clearly some ages do have higher than 50 in

Does that mean you want to exclude the whole path or only matching vertices on the path? If the latter, then what about the edges? Taking out a single vertex leaves 2 invalid edges on the path. If the

What's the best way to filter a path based on a Vertex property. I am using the gremlin-scala lib. This is the code: val paths = startVertex.asScala().start()

Does anyone know of a good scala client? Shold I use 'gremlin-scala_2.12'?

Hello, Can someone let me know if there is a benchmarking tool for Graph Dbs (particularly for JanusGraph) like YCSB for NOSQL databases and Cassandra-Stress specific tp Cassandra Db. Anyone using

Welcome, David! It's great to have you on board!

Thank you for looking into this for me. In general, Janus seems pretty spiffy. Nice work done here so far.