|
Re: com.datastax.driver.core.exceptions.BusyPoolException with CQL backend
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
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
|
By
Scott P <scott_p...@...>
·
#680
·
|
|
Re: com.datastax.driver.core.exceptions.BusyPoolException with CQL backend
Are you iterating your results all the way out?
Robert Dale
Are you iterating your results all the way out?
Robert Dale
|
By
Robert Dale <rob...@...>
·
#683
·
|
|
Re: com.datastax.driver.core.exceptions.BusyPoolException with CQL backend
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.
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.
|
By
Jason Plurad <plu...@...>
·
#676
·
|
|
com.datastax.driver.core.exceptions.BusyPoolException with CQL backend
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
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
|
By
scott_p...@...
·
#675
·
|
|
Re: extras that provide business value
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
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
|
By
Misha Brukman <mbru...@...>
·
#679
·
|
|
Re: extras that provide business value
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
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
|
By
Robert Dale <rob...@...>
·
#678
·
|
|
Re: filtering a path
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
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
|
By
Daniel Kuppitz <me@...>
·
#674
·
|
|
Re: Janus Graph benchmarking
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
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
|
By
Misha Brukman <mbru...@...>
·
#677
·
|
|
Re: filtering a path
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
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
|
By
Yair Ogen <yair...@...>
·
#684
·
|
|
Re: filtering a path
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
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
|
By
Daniel Kuppitz <me@...>
·
#673
·
|
|
filtering a path
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()
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()
|
By
yair...@...
·
#672
·
|
|
Scala client
Does anyone know of a good scala client?
Shold I use 'gremlin-scala_2.12'?
Does anyone know of a good scala client?
Shold I use 'gremlin-scala_2.12'?
|
By
yair...@...
·
#671
·
|
|
Janus Graph benchmarking
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
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
|
By
nav...@...
·
#670
·
|
|
Re: New committer: David Clement
Welcome, David! It's great to have you on board!
Welcome, David! It's great to have you on board!
|
By
sju...@...
·
#669
·
|
|
Re: Proper way to define metaproperties in schema
Thank you for looking into this for me. In general, Janus seems pretty spiffy. Nice work done here so far.
Thank you for looking into this for me. In general, Janus seems pretty spiffy. Nice work done here so far.
|
By
David Brown <dave...@...>
·
#668
·
|
|
Re: Proper way to define metaproperties in schema
Thanks for the reproduce scenario.
I opened up an issue to track this https://github.com/JanusGraph/janusgraph/issues/487
Thanks for the reproduce scenario.
I opened up an issue to track this https://github.com/JanusGraph/janusgraph/issues/487
|
By
Jason Plurad <plu...@...>
·
#667
·
|
|
Re: New committer: David Clement
Congrats and welcome, David!
Congrats and welcome, David!
|
By
Jerry He <jerr...@...>
·
#666
·
|
|
Re: Proper way to define metaproperties in schema
For the record, the output of the same script when run against TinkerGraph 3.2.6 is as expected:
properties: [{'string_prop': [vp[string_prop->dave]], 'integer_prop': [vp[integer_prop->1]],
For the record, the output of the same script when run against TinkerGraph 3.2.6 is as expected:
properties: [{'string_prop': [vp[string_prop->dave]], 'integer_prop': [vp[integer_prop->1]],
|
By
David Brown <dave...@...>
·
#664
·
|
|
Re: Proper way to define metaproperties in schema
Ok, I built from source. It appears that this is happening specifically with properties defined as Floats. The following script in gremlin_python (3.2.6) illustrates this problem:
from
Ok, I built from source. It appears that this is happening specifically with properties defined as Floats. The following script in gremlin_python (3.2.6) illustrates this problem:
from
|
By
David Brown <dave...@...>
·
#663
·
|
|
Re: Proper way to define metaproperties in schema
Would you be able to test your scenario against JanusGraph master branch? It's running TP 3.2.6.
Would you be able to test your scenario against JanusGraph master branch? It's running TP 3.2.6.
|
By
Jason Plurad <plu...@...>
·
#662
·
|