search

pietermartin / sqlg

TinkerPop graph over sql
MIT License
242 stars 51 forks source link

Optimize different paths to the same Element/values to use union #204

Closed pietermartin closed 2 years ago

pietermartin commented 7 years ago

a1---ea--->b1 a1---eb--->b2 a1---ec--->b3 a1---ed--->b4 g.V().hasLabel("A").out()

Sqlg should be able to optimize this with a union clause as the resulting element is the same.

The same goes for,

a1---eb--->b1 a1---ec--->c1 a1---ed--->d1 a1---ee--->e1 g.V().hasLabel("A").out() (1) g.V().hasLabel("A").out().values("name") (2)

2 should be able to be optimized.

pietermartin commented 2 years ago

Don't know what this is about anymore.