Questions tagged [tinkerpop]
Apache TinkerPop™ is a graph computing framework for both graph databases (OLTP) and graph analytic systems (OLAP).
tinkerpop
92
questions
1
vote
1
answer
2k
views
Gremlin - Choose one item at random
Consider me as 'user' 1. The aim of the query is to get the posts 'posted' by the people I follow and for each of those posts check:
Whether it has been liked by me
Whether it has been liked by ...
4
votes
1
answer
2k
views
Tinkerpop/gremlin merge vertices (and edges)
Is there an easy way to replace or merge vertices and keep/merge existing edges? Or just manually copy all properties from the vertex and recreate existing edges and all (meta-)properties and then ...
14
votes
6
answers
9k
views
How can I remotely connect to a JanusGraph server?
I want to use Java API to manipulate graph on a remote server, the server actually hosts in localhost. The code I use to connect server is:
JanusGraphFactory.Builder b = JanusGraphFactory.build();
b....
4
votes
1
answer
5k
views
How to import a CSV file into Titan graph database?
Can anyone supply some sample code or hints on how to import a 1MB CSV of nodes, and another 1MB CSV of edges, into Titan graph database running on Cassandra?
I've got small CSV files importing via ...
4
votes
2
answers
3k
views
Titan Db ignoring index
I have a graph with a couple of indices. They're two composite indices with label restraints. (both are exactly the same just on different properties/labels).
One definitely seems to work but the ...
0
votes
1
answer
362
views
Gremlin traverse path along the same property
I am trying to implement a gremlin query to for getting all vertex on same path based on property value. My graph looks like this. The label on graph is showing
name property and id for vertex
...
10
votes
3
answers
4k
views
Choosing an appropriate way to use Neo4j in Python
I am currently using embedded python binding for neo4j. I do not have any issues currently since my graph is very small (sparse and upto 100 nodes). The algorithm I am developing involves quite a lot ...
9
votes
1
answer
4k
views
gremlin python - add multiple but an unknown number of properties to a vertex
I want to add more than one property to a vertex, but from the outset do not explicitly know what those properties might be. For example, say for one person to be added as vertex to the graph, we have ...
5
votes
1
answer
12k
views
How to collect all vertex and edge properties along path, with Gremlin
Here's a really simple query:
g.V('customerId').out().path()
The JSON output of this is
{
"requestId":"96b26c1d-d032-2004-d36e-c700bd6db2a2",
"status":{
"message":"",
"code":...
4
votes
1
answer
1k
views
Setup and configuration of Titan for a Spark cluster and Cassandra
There are already several questions on the aurelius mailing list as well as here on stackoverflow about specific problems with configuring Titan to get it working with Spark. But what is missing in my ...
3
votes
1
answer
2k
views
gremlin intersection operation
I'm using the gremlin console v3.3.1.
Using the "Modern" graph from the tutorial:
http://tinkerpop.apache.org/docs/current/tutorials/getting-started/
Creating the graph with this:
gremlin>graph =...
3
votes
1
answer
484
views
TinkerPop: Adding Vertex Graph API v/s Traversal API
Background:
In one of the SO posts it is recommended to use Traversal API than Graph API to make mutation. So I tried out some tests and found Graph API seemed to be faster, I do totally believe the ...
3
votes
2
answers
1k
views
Java GraphTraversal output Gremlin query
How to output Gremlin query from a Java GraphTraversal object? The default output (graphTraversal.toString()) looks like [HasStep([~label.eq(brand), name.eq(Nike), status.within([VALID])])] which is ...
2
votes
1
answer
683
views
Turn gremlin query result with elementMap into JSON [gremlinpython 3.6.1]
Continuing discussion from here.
I've a query that provides list of paths along-with elementMap().
How do I convert this data to JSON to be consumed by rest of the code.
I did look here that talks ...
2
votes
1
answer
2k
views
Query to check if there is a cycle in a graph with edges visited only once
How to write an query runs on my graph, that outputs 'false' if there is NO path traversing through each edge only once and return to the starting point.