I'd prefer a non sql solution for this.
Am Sonntag, 11. Dezember 2016 09:48:44 UTC-2 schrieb Ray Neiheiser:
>
> Anyone has an idea?
>
> Am Montag, 5. Dezember 2016 15:39:45 UTC-2 schrieb Ray Neiheiser:
>>
>> It's very strange also with:
>>
>> StreamSupport.stream(startNodes.spliterator(), false).f
Anyone has an idea?
Am Montag, 5. Dezember 2016 15:39:45 UTC-2 schrieb Ray Neiheiser:
>
> It's very strange also with:
>
> StreamSupport.stream(startNodes.spliterator(), false).flatMap(vertex1 ->
> StreamSupport.stream(vertex1.getEdges(Direction.OUT,
> relationshipId).spliterator(), false)).coll
It's very strange also with:
StreamSupport.stream(startNodes.spliterator(), false).flatMap(vertex1 ->
StreamSupport.stream(vertex1.getEdges(Direction.OUT,
relationshipId).spliterator(), false)).collect(Collectors.toList())
It seems like I am unable to detect the outgoing edges of the vertices.
T
That seems like an option.
But isn't there any option in gremlin for it?
Titan also uses gremlin and I can use:
GraphTraversal tempOutput =
graph.traversal().V(nodeStartList.toArray()).bothE().filter(__.otherV().is(P.within(nodeEndList.toArray(;
Which will give me exactly what I want.
Am
not sure if this may work for you, but you could query via sql something
like
select from E where out contains [, , ]
and in contains [, , ] and =
"something"
Il giorno mercoledì 30 novembre 2016 15:19:24 UTC+1, Ray Neiheiser ha
scritto:
>
> I have some performance problems with reading edge
Exactly, I need to find edges knowing start and vertices and it's possible
that I know edge label and property sometimes as well.
Am Mittwoch, 30. November 2016 20:19:45 UTC-2 schrieb Ivan Mainetti:
>
> please help me understand, you need to search edges knowing start and end
> vertices?
>
>
> I
please help me understand, you need to search edges knowing start and end
vertices?
Il giorno mercoledì 30 novembre 2016 15:19:24 UTC+1, Ray Neiheiser ha
scritto:
>
> I have some performance problems with reading edges depending on their
> start and end nodes. Is there a better way than checki
Hi, did you tried it using indexes?
Il giorno mercoledì 30 novembre 2016 15:19:24 UTC+1, Ray Neiheiser ha
scritto:
>
> I have some performance problems with reading edges depending on their
> start and end nodes. Is there a better way than checking every edges end
> vertex of every start verte
No, I didn't but I can't just put an index for every node I have?
Isn't there any way like graph.getEdgeByVertex(startVertex, endVertex,
properties) ?
Or anything which isn't the way like I resolved it above.
Am Mittwoch, 30. November 2016 14:24:36 UTC-2 schrieb Oleksandr Gubchenko:
>
> Hi, did
