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
1 answer

Value Aggregation along Traversal Gremlin Cosmos DB

I need to perform a query of the following form: I have a tree structure with costs at the leaf node. I need a single query to give me all the aggregated costs under the root node. For example in the above graph, I would expect an output from my…
Raghav Anand
  • 25
  • 4
0
votes
1 answer

Using efficiently JUNG with TinkerPop3

I am using TinkerPop3 in Java and I have a weighted multi-graph on which I would like to run Dijkstra algorithm to find Shortest Weighted Path between two vertices. I have found in other questions that the recommended way to do this is by using JUNG…
Zak
  • 85
  • 1
  • 5
0
votes
1 answer

Count states and cities with one gremlin query

I use orientDb with thinkerpop 3 support and the data is like this: One country has multiple states and this states has multiple cities (one exception for my example is that not every state has cities). I would like to count the states and the…
Marcel
  • 377
  • 5
  • 16
0
votes
1 answer

How do I wrap each element in the list into an object?

I have the following gremlin query where I am querying multiple edges and then their accompanying verticies outE('childSolution') .inV() .local(union( identity() …
Jonathan Fishbein
  • 516
  • 2
  • 18
0
votes
1 answer

It doesn't add an edges with the right in and out vertices

I'd like to add a new edge between two vertices. Here is the command I'm using def graph=ConfiguredGraphFactory.open('graph'); def g = graph.traversal(); graph.addVertex(label, 'Person', 'name', 'Jack', 'entityId', '100'); graph.addVertex(label,…
Baptiste Arnaud
  • 2,522
  • 3
  • 25
  • 55
0
votes
1 answer

TinkerPop running a very long length query crashes

Massive Query 3500~…
Srinath Ganesh
  • 2,496
  • 2
  • 30
  • 60
0
votes
1 answer

Gremlin python filter by gte or lte

I am trying to find a vertex that has a property called last_time_stamp which is between the range of last_time_stamp and last_timestamp - 1hour. The query below seems to work in AWS Neptune but fails in the Gremlin Python script. I believe its…
kilomo500
  • 39
  • 1
  • 6
0
votes
1 answer

Gremlin finding all connected paths is taking for ever

Test 1: TinkerPop Modern Query: g.V().hasLabel("person").as("from") .repeat(both().as("to").dedup("from", "to")) .emit(hasLabel("software")) .hasLabel("software") .project("p","data") .by(path()) .by(select(last, "from", "to").by("name")) Executed…
Srinath Ganesh
  • 2,496
  • 2
  • 30
  • 60
0
votes
1 answer

Gremlin filter from previous step

Currently working on a proof of concept for a recommendation engine. Example. public default GraphTraversal> suggestedFriends(Long limit) { return out("friendship") .as("myFriends") .out("friendship") …
Ernesto C.
  • 1
  • 2
0
votes
1 answer

Gremlin query to find k distance vertices

I was trying to run a gremlin query to find k distance vertices from a given vertex v and omit directly connected vertices to v. I am using Gremlin 3.2.6. So, something like this, for a k-distance(friend of friend) isn't working…
J.Doe
  • 183
  • 1
  • 13
0
votes
1 answer

How to change version of Goblin OGM Serializer for Janusgraph (TinkerPop 3.2.6) #101

I am trying out a Python application to connect to a Janusgraph 0.2.0. I followed all the setup instructions and I am able to create elements in the graph and traverse them successfully. import asyncio from goblin import Goblin from quart import…
Cracoras
  • 347
  • 3
  • 16
0
votes
1 answer

Gremlin find all connected Vertices over n levels

I am basically trying to search all the connected Vertices for a node type, the Cypher query version gives me the expected result, but the Gremlin version is not giving me the intended result. Any thing that I am doing incorrectly?? Visual…
Srinath Ganesh
  • 2,496
  • 2
  • 30
  • 60
0
votes
0 answers

Error while connecting to JanusGraph

I have the following code: trait InMemoryConnectScala { def messageSerializer(): MessageSerializer = { import java.util.Collections import org.apache.tinkerpop.gremlin.driver.ser.GryoMessageSerializerV1d0 import…
allthenutsandbolts
  • 1,513
  • 1
  • 13
  • 34
0
votes
1 answer

Tinkerpop very slow when getting vertexes or paths from traversal

I have a graph traversal in my Java application that is taking upwards of 300ms to fill the path object after the traversal is complete. Its strange because it only happens on some specific traversals, while other traversals fill their paths…
Matt Brown
  • 435
  • 4
  • 17
0
votes
1 answer

return both a 'graphml' subgraph and a collection from 1 traversal in Gremlin

I have one Gremlin traversal that looks like this: g.V().hasLabel("Firma").has("cui","2816464") ..........subgraph('sub') ......otherV() ...?????.... If I want to get a collection of vertex properties I will end the traversal with: …
Mihai Bucica
  • 21
  • 1
  • 5
1 2 3
…
48 49