Re: [orientdb] Get Edges Between Vertices (Again)

Hi John, Happy to see it helped. Keep us posted the progress of your project!!! Thanks Luigi 2017-03-20 5:09 GMT+01:00 John J. Szucs : > Luigi, > > To close this out, I implemented your Option #2 suggestion. I found at > very good example at

Re: [orientdb] Get Edges Between Vertices (Again)

Luigi, To close this out, I implemented your Option #2 suggestion. I found at very good example at http://stackoverflow.com/questions/32953396/orientdb-edge-index-via-java and the results are absolutely spectacular! Thanks for your help! BTW: We will soon be launching our technology, which

Re: [orientdb] Get Edges Between Vertices (Again)

Hi John, In MATCH statement (2.2) and more in general in 3.0 we are changing the optimization of queries based on indexes, but you will still need an index on the edge for such use case, so the big part of the work will be needed anyway. Thanks Luigi 2017-03-16 12:43 GMT+01:00 John J. Szucs

Re: [orientdb] Get Edges Between Vertices (Again)

Luigi, Yes, this helps. Your option #2 is more applicable to my project. Will OrientDB 3.0 significantly change/improve this use case? I don't want to implement this manual edge index if it will become unnecessary in (a few?) weeks. Thanks! -- John > On Mar 16, 2017, at 07:24, Luigi

Re: [orientdb] Get Edges Between Vertices (Again)

Hi John, you have two alternatives: 1) use OrientVertex.countEdges() to check which of the two vertices has a smaller number of edges. This approach is good if you know that at most one is a supernode 2) if you know that both vertices can be supernodes, then the only efficient way to find the