Gremlin: How to get duplicates in a graph?

Question

Assume I have a graph with vertices that have property name, what is a good way to get Ids of all vertices that have the same name.

Extending this, if I have a graph with day and month properties, how to return IDs of these vertices that share the same values.

Did any of the solutions below work out for you? ps: would be useful if you mark them as a solution, btw. — haikalpribadi, Jul 22 '16 at 13:23

score 5 · Answer 1 · answered Apr 22 '16 at 15:28

5

Assuming you don't know the value of the duplicates and you just want to find all duplicates possible:

Here is a quick and dirty solution for you. Use Group By, for example:

g.V().has("name").limit(50).group().by("name");

I only use limit because doing this operation on the whole graph will be very time consuming. For the day and month properties you can do the same thing.

answered Apr 22 '16 at 15:28

Filipe Teixeira

3,565
1
25
45

3

It's not really "the same thing" for multiple properties. For `day` and `month` it would be `.group().by(valueMap("day","month"))`. – Daniel Kuppitz Apr 23 '16 at 07:27
How would you eliminate any group that has only one vertex in it? – Mohamed Taher Alrefaie Apr 23 '16 at 18:02
Not sure how to do that within the traversal itself. There is a `groupCount` predicate that may be of use but not sure how. `g.V().has("DEGREE").limit(50).groupCount().by("name")` – Filipe Teixeira Apr 25 '16 at 09:14

score 0 · Answer 2 · answered Apr 22 '16 at 15:34

Assuming you have created indices for these indexed properties before you created the vertices, then you can create a gremlin query like: def g = graph.traversal(); def vertices = g.V().has("name", "David").id();

This assumes you know the value you are searching for.

Gremlin: How to get duplicates in a graph?

2 Answers2