Questions tagged [janusgraph]

JanusGraph is a scalable graph database optimized for storing and querying graphs containing hundreds of billions of vertices and edges distributed across a multi-machine cluster. JanusGraph is a transactional database that can support thousands of concurrent users executing complex graph traversals in real time. When posting questions, please include environment details, such as the storage and indexing backends used.

JanusGraph is a scalable graph database optimized for storing and querying graphs containing hundreds of billions of vertices and edges distributed across a multi-machine cluster. JanusGraph is a transactional database that can support thousands of concurrent users executing complex graph traversals in real time.

When posting questions, please include environment details, such as the storage and indexing backends used.


Resources:


Related tags:

857 questions
0
votes
0 answers

calculation of the weight of the path issue

We have below DataSource and we have below script. robin = graph.addVertex(label,'person','name','robin'); jeff = graph.addVertex(label,'person','name','jeff'); andrew =…
Jeff
  • 117
  • 10
0
votes
1 answer

Adding Edge to Janusgraph via Gremlin interface

Can anyone explain why this doesn't seem to do anything ve = g.addV("test").as("m").iterate() g.addV("test2").as("q").V(ve).addE("contains").from("q").iterate() g.V().hasLabel("test2").outE().otherV().path() The operation executes without error but…
magicaltrout
  • 494
  • 3
  • 14
0
votes
1 answer

Performance issue of calculation for the weight for ego net

We have the below Graph Data below. only 5 Vertexes but we have many Edges. How can I handle below Querys?I would like to get the path from one node to one other. I just want to get the cycle path and calculate sum of the weight of the ego. The…
Jeff
  • 117
  • 10
0
votes
1 answer

We met the query performance issue. While we run the query JanusGraph Hooked

We have the below Graph Data below. only 5 Vertexes but we have many Edges. How can I handle below Querys?I would like to get the path from one node to one other. Or I just want to get the cycle path. suresh =…
Jeff
  • 117
  • 10
0
votes
1 answer

What index is needed to answer a disjunct (__.or) query?

I want to find a set of User vertices that match a given search string. These vertices have four String properties to match against - FIRST_NAME, LAST_NAME, DISPLAY_NAME and EMAIL. My query is constructed like so: Query GraphTraversal
Double M
  • 1,449
  • 1
  • 12
  • 29
0
votes
1 answer

Gremlin.Net return multi sub vertex in the same array

Usually family contains one father and mother but multi children, In gremlin I can say to get a…
janus graph
  • 407
  • 1
  • 3
  • 18
0
votes
1 answer

JanusGraph get vertex by id/key

I did a few scattered imports from GraphSON formatted files. As a result now when I execute the command g.V(), I receive the following results: ==>v[{@type=g:Int32, @value=1}] ==>v[0] ==>v[1] ==>v[{@type=g:Int32, @value=3}] ==>v[{@type=g:Int32,…
user732456
  • 2,638
  • 2
  • 35
  • 49
0
votes
1 answer

How to update a disabled mixed index to enabled?

Now i have an mixed index,it's status is DISABLED like this : gremlin> m.getGraphIndex('singleProperty_mixedIndex').getIndexStatus(m.getPropertyKey('prop1')) ==>DISABLED now i want to update this index's status to ENABLED,how can i to do? I have…
juwuba
  • 73
  • 1
  • 9
0
votes
1 answer

How can I cycle all the vertex that are connected?

In JanusGraph I have 4 nodes. A(name=alice) -> B B -> C C -> D D -> A I want to get all the cycles from node A. g.V().has('name', 'alice').both().both().cyclicPath().path().by('name') I can get A->B->A and A->D->A. But I can't get A->B->C->D->A. I…
Jeff
  • 117
  • 10
0
votes
1 answer

Configuring JanusGraph to use Lucene via Java

I am trying to connect to JanusGraph using the following code: Graph graph = GraphFactory.open(new PropertiesConfiguration("janusgraph.propertes"); Where my janusgraph.properties file is as…
James Baker
  • 1,143
  • 17
  • 39
0
votes
1 answer

JanusGraph function cyclicPath()

g.V().has('name', 'alice').both().both().cyclicPath().path().by('name') Why we need 2 both()s to get the cyclicPath()?
Jeff
  • 117
  • 10
0
votes
1 answer

There are high availability on the GremlinServers

Reading the documentation of Janusgraph, I understand that high availability only exists in the storage system or backend. (Cassandra). But, is there high availability on the GremlinServers? For example in mode 16.3. Remote server Mode with Gremlin…
lubican
  • 29
  • 1
  • 6
0
votes
1 answer

When janusgraph Mixed index is indexed?

I use Janusgraph 0.2.0 and ES backend. when indexed? Once a vertex or edge is added and the transaction is successfully committed, can I consider that the mixed indexes related to the transaction are immediately available? Or, the mixed indexes are…
takaomag
  • 1,545
  • 1
  • 16
  • 26
0
votes
1 answer

VertexIDs of vertex can collide or not, when you put several Janusserver

I have a question. I would like to know if vertex IDs of vertex can collide or not, when you put several Janusserver inserting vertices against the same Cassandra?
lubican
  • 29
  • 1
  • 6
0
votes
1 answer

JanusGraph can not connect to ElasticSearch after Cluster Name change

I'm trying to instantiate JanusGraph with the following configuration, using Cassandra as storage backend and ElasticSearch as indexing backend: JanusGraph graph = JanusGraphFactory.build() .set("storage.backend", "cassandra") …
Double M
  • 1,449
  • 1
  • 12
  • 29