Stack Overflow
Stack Overflow

Questions tagged [tinkerpop3]

Apache TinkerPop™ is an open source graph technology stack, providing a storage agnostic interface to graph databases and graph analytics frameworks. Tinkerpop 3.x represents a major change in the API since 2.x given a complete re-write with Java 8 and refined thinking with respect to graph traversal mechanisms for both OLTP and OLAP.

Apache TinkerPop™ 3.x provides graph computing capabilities for both graph databases (OLTP) and graph analytic systems (OLAP) under the Apache2 license.

It offers:

  • A standard, vendor-agnostic graph API on the JVM (needs Java 8)
  • In-memory reference implementation of this API, TinkerGraph
  • A standard, vendor-agnostic graph query language, called "Gremlin" (Groovy based)
  • OLTP and OLAP engines for evaluating query
  • A command line shell, Gremlin shell
  • Visualization, via Gephi Integration

More information:

731 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

Flatten a graph traversal map in TinkerPop3

My use case is that a current user of the system has access to a set of groups. These groups can belong to other groups. So I would like to get to all the base groups and the parent groups in one query. g.V(currentUser) .out("access-to") …
Sathyakumar Seshachalam
  • 2,013
  • 3
  • 20
  • 32
0
votes
1 answer

How to print the output of Tinkerpop (TinkerGraph) queries in a java environment?

I have been working with Apache Tinkerpop 3.3 in a Java environment and I have been having trouble printing the output of the queries I make. For example, when I use the following code: GraphTraversalSource g =…
E.Brum
  • 43
  • 1
  • 5
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
4 answers

Gremlin 3 - get all incoming and outgoing vertices, including their edges and directions and including vertices without edges

I'm trying to compose one query to get all incoming and outgoing vertices, including their edges and directions, which would however return those vertices without edges as well. I was able to work around the problem for now by forcing everything to…
Dejan Janjušević
  • 3,181
  • 4
  • 41
  • 67
0
votes
1 answer

Can I get CosmosDB graph to return edge details for vertex objects in query results?

Consider the following simple gremlin query: g.V("some_id") When executed against my CosmosDB graph database from the "Data Explorer" tab of the Azure web UI, I get the following results: [{ "id": "some_id", "label": "some_type "type":…
Voobr
  • 243
  • 1
  • 2
  • 5
0
votes
1 answer

Tinkerpop console returns nullpointerexception when reading graphml with subgraph

I'm just getting started with the tinkerpop console and am interested in using it to work with graphml files that have subgraphs. I have gone through the 'Getting Started' and started the other documentation. While I can import a graphml file…
not-bob
  • 815
  • 1
  • 8
  • 23
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

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

How to traverse graph created using ConfiguredPlanFactory in JanusGraph?

I have set up a Janusgraph Cluster with Cassandra + ES. The cluster has been set up to support ConfiguredGraphFactory. Also, I am connecting the gremlin cluster remotely. I have set up a client and am able to create a graph using…
AKG
  • 598
  • 6
  • 18
0
votes
0 answers

OrientDB 3.x - orientdb-gremlin - Edge Index Lookup

I created an inout edge index. How can I now iterate over the edges if I know the in and out elementId? With Tinkerpop 2.4 this was done via: Iterable edges = orientBaseGraph.getEdges("e." + edgeLabel + "_inout", new OCompositeKey(fromId,…
Jotschi
  • 3,270
  • 3
  • 31
  • 52
0
votes
0 answers

OrientDB 3.x - orientdb-gremlin - Vertex Index Lookup

What is the correct way to utilize a previously created vertex index within a traversal? I want find the vertex with a specific key/value. I thus created a unique index on a specific vertex class. My traversal works but I have the feeling index is…
Jotschi
  • 3,270
  • 3
  • 31
  • 52
0
votes
2 answers

How can I use a gremlin query to filter based on a users permissions?

I am fairly new to graph databases, however I have used SQL Server and document databases (Lucene, DocumentDb, etc.) extensively. It's completely possible that I am approaching this query the wrong way, since I am new to graph databases. I am trying…
Christopher Haws
  • 1,715
  • 21
  • 21
0
votes
1 answer

OGM/ORM for OrientDB

I am looking for a OGM for OrientDb - something that will allow me to persist my domain model (POJO) as vertices and edges declaratively (using annotations perhaps). I stumbled upon Ferma which seems to have the annotations support but I can't find…
341008
  • 9,862
  • 11
  • 52
  • 84
1 2 3
…
48 49