|
Re: Database Level Caching
Hi Boxuan,
I have configured janusgraph with:
cache.db-cache-time: 600000 cache.db-cache: true
cache.db-cache-size: 50000000
index.search.elasticsearch.create.ext.number_of_replicas:
Hi Boxuan,
I have configured janusgraph with:
cache.db-cache-time: 600000 cache.db-cache: true
cache.db-cache-size: 50000000
index.search.elasticsearch.create.ext.number_of_replicas:
|
By
Nicolas Trangosi <nicolas...@...>
·
#5482
·
|
|
Re: Database Level Caching
Hi Nicolas,
Can you provide your configurations and the memory usage you observed?
Regards,
Boxuan
Hi Nicolas,
Can you provide your configurations and the memory usage you observed?
Regards,
Boxuan
|
By
BO XUAN LI <libo...@...>
·
#5483
·
|
|
How to see the ns (name space) values of janus graph
I have rfd data which is in turtle or xml format. Now the data is having the vertex property name in the form of URL so when I upload that data to Janus graph it converts those URL values to ns1,ns2
I have rfd data which is in turtle or xml format. Now the data is having the vertex property name in the form of URL so when I upload that data to Janus graph it converts those URL values to ns1,ns2
|
By
Arpan Jain <arpan...@...>
·
#5478
·
|
|
Database Level Caching
Hi,
I try to use Database Level Caching as described in https://docs.janusgraph.org/basics/cache/ but it seems to use more memory than the configured threshold (cache.db-cache-size ). Does anyone use
Hi,
I try to use Database Level Caching as described in https://docs.janusgraph.org/basics/cache/ but it seems to use more memory than the configured threshold (cache.db-cache-size ). Does anyone use
|
By
Nicolas Trangosi <nicolas...@...>
·
#5480
·
|
|
Re: Failed to find all paths between 2 vertices upon the graph having 100 million vertices and 100 million edges using SparkGraphComputer
Hi Marc
My graph has 100 million edges not 100 edges. Sorry for my miswriting. From your advice I think I need to do two things. Firstly I need to dig into ConnectedComponentVertexProgram and manage
Hi Marc
My graph has 100 million edges not 100 edges. Sorry for my miswriting. From your advice I think I need to do two things. Firstly I need to dig into ConnectedComponentVertexProgram and manage
|
By
Roy Yu <7604...@...>
·
#5477
·
|
|
Re: Slow convert to Java object
Answered here: https://github.com/JanusGraph/janusgraph/issues/2324
Answered here: https://github.com/JanusGraph/janusgraph/issues/2324
|
By
BO XUAN LI <libo...@...>
·
#5481
·
|
|
Re: How to interact with Janusgraph using NodeJs
How did you fix it?
By
Yamiteru XYZ <yamit...@...>
·
#5476
·
|
|
Could not alias [g] to [g] as [g]
Hi, I have JanusGraph with Scylla and Elasticsearch in a docker. I'm connecting to JanusGraph on backend using gremlin.
I see this error only on my server and not on my local machine. What does it
Hi, I have JanusGraph with Scylla and Elasticsearch in a docker. I'm connecting to JanusGraph on backend using gremlin.
I see this error only on my server and not on my local machine. What does it
|
By
Yamiteru XYZ <yamit...@...>
·
#5475
·
|
|
Re: Failed to find all paths between 2 vertices upon the graph having 100 million vertices and 100 million edges using SparkGraphComputer
Hi Roy,
Nice to see you back here, still going strong!
I guess the TraversalVertexProgram used for OLAP traversals is not well suited to your use case. You must realize that 200 stages in an OLAP
Hi Roy,
Nice to see you back here, still going strong!
I guess the TraversalVertexProgram used for OLAP traversals is not well suited to your use case. You must realize that 200 stages in an OLAP
|
By
HadoopMarc <bi...@...>
·
#5474
·
|
|
Failed to find all paths between 2 vertices upon the graph having 100 million vertices and 100 million edges using SparkGraphComputer
The graph has 100 million vertices and 100 edges
Graph data is saved at HBase Table: MyHBaseTable.
The size of MyHBaseTable is 16.2GB:
root@~$ hdfs dfs -du -h /apps/hbase/data/data/default/
16.2 G
The graph has 100 million vertices and 100 edges
Graph data is saved at HBase Table: MyHBaseTable.
The size of MyHBaseTable is 16.2GB:
root@~$ hdfs dfs -du -h /apps/hbase/data/data/default/
16.2 G
|
By
Roy Yu <7604...@...>
·
#5473
·
|
|
Re: Running OLAP on HBase with SparkGraphComputer fails with Error Container killed by YARN for exceeding memory limits
Thanks Evgenii
By
Roy Yu <7604...@...>
·
#5472
·
|
|
Re: Remote Traversal with Java
Hi Peter,
This seems more relevant:
https://docs.janusgraph.org/basics/configured-graph-factory/#graph-and-traversal-bindings
So, some JanusGraph and GraphTraversalSource objects are created remotely
Hi Peter,
This seems more relevant:
https://docs.janusgraph.org/basics/configured-graph-factory/#graph-and-traversal-bindings
So, some JanusGraph and GraphTraversalSource objects are created remotely
|
By
HadoopMarc <bi...@...>
·
#5470
·
|
|
Slow convert to Java object
Hi!
I am trying write select-query and my perfomance is very slow when I call method toList().
How I can improve this perfomace ?
My example:
long start;
long end;
try
Hi!
I am trying write select-query and my perfomance is very slow when I call method toList().
How I can improve this perfomace ?
My example:
long start;
long end;
try
|
By
Maxim Milovanov <milov...@...>
·
#5469
·
|
|
Re: Remote Traversal with Java
Hi Peter,
Have you tried the suggestions from an earlier thread:
https://groups.google.com/g/janusgraph-users/c/w2_qMchATnw/m/zoMSlMO5BwAJ
Best wishes, Marc
Op woensdag 30 december 2020 om
Hi Peter,
Have you tried the suggestions from an earlier thread:
https://groups.google.com/g/janusgraph-users/c/w2_qMchATnw/m/zoMSlMO5BwAJ
Best wishes, Marc
Op woensdag 30 december 2020 om
|
By
HadoopMarc <bi...@...>
·
#5468
·
|
|
Re: Degree-Centrality Filtering & Search – Scalable Strategies for OLTP
Hi Zach,
If you want to run the query in a multi-threading manner, try enabling “query.batch” (ref: https://docs.janusgraph.org/basics/configuration-reference/#query).
Since you are using
Hi Zach,
If you want to run the query in a multi-threading manner, try enabling “query.batch” (ref: https://docs.janusgraph.org/basics/configuration-reference/#query).
Since you are using
|
By
BO XUAN LI <libo...@...>
·
#5471
·
|
|
Re: Degree-Centrality Filtering & Search – Scalable Strategies for OLTP
Hi Marc, Boxuan,
Thank you for the discussion. I have been experimenting withdifferent queries including your id() suggesting Marc. Along Boxuan’s feedback, the where() stepperforms about the same
Hi Marc, Boxuan,
Thank you for the discussion. I have been experimenting withdifferent queries including your id() suggesting Marc. Along Boxuan’s feedback, the where() stepperforms about the same
|
By
"zb...@gmail.com" <zblu...@...>
·
#5466
·
|
|
Remote Traversal with Java
Dear All,
I have installed/configured a single node JanusGraph Server with a Berkeley database backend and ConfigurationManagementGraph support so that I can create/manage multiple graphs on the
Dear All,
I have installed/configured a single node JanusGraph Server with a Berkeley database backend and ConfigurationManagementGraph support so that I can create/manage multiple graphs on the
|
By
Peter Borissow <peter....@...>
·
#5464
·
|
|
Re: Degree-Centrality Filtering & Search – Scalable Strategies for OLTP
Hi Marc,
I think it will be as same slow as the initial one if not even slower. If I recall correctly, JanusGraph always fetches the whole edge (column + value) even if you only need the count (in
Hi Marc,
I think it will be as same slow as the initial one if not even slower. If I recall correctly, JanusGraph always fetches the whole edge (column + value) even if you only need the count (in
|
By
BO XUAN LI <libo...@...>
·
#5467
·
|
|
Re: Degree-Centrality Filtering & Search – Scalable Strategies for OLTP
Hi Zach, Boxuan,
There is one thing I do not understand. According to the JanusGraph datamodel, the outE relatationIdentifiers are stored in the vertex. So, retrieving all outE() relationIdentifiers
Hi Zach, Boxuan,
There is one thing I do not understand. According to the JanusGraph datamodel, the outE relatationIdentifiers are stored in the vertex. So, retrieving all outE() relationIdentifiers
|
By
HadoopMarc <bi...@...>
·
#5463
·
|
|
Re: Degree-Centrality Filtering & Search – Scalable Strategies for OLTP
Hi Zach,
I have some concerns over concurrency and consistency issues, but this might still be a nice feature to have. I think you could open a new discussion on
Hi Zach,
I have some concerns over concurrency and consistency issues, but this might still be a nice feature to have. I think you could open a new discussion on
|
By
BO XUAN LI <libo...@...>
·
#5465
·
|