Avi Avni

would you like to have a zoom meeting with us about this?

currently this can be done by ``` GRAPH.QUERY x "MATCH ()-[r]->() WHERE type(r) = 'R' RETURN r" ``` this is not a suggested way to write a performant query

https://github.com/RedisGraph/libcypher-parser/pull/18 merged please update to latest master

you can use ``` match (n:N) where (n)-[:R]->() return count(n) ```

Sorry about the late response about this but we are not going to take this for now thanks a lot for all your contributions

> @rafie sorry for catching up on this work so late, but I prefer we do not touch Makefiles of our dependencies. it is not changes to the GraphBLAS makefiles...

please resolve conflict

what do you this of: ``` MATCH (n1:person{name:'Alice'}) RETURN n1 UNION MATCH (n2:person{name:'Bob'}) RETURN n2 ``` other option ``` MATCH (n1:person{name:'Alice'}) WITH collect(n1) AS c1 MATCH (n2:person{name:'Bob'}) WITH c1, collect(n2)...

This is sound like it need to be implemented with CompilationRepresentationAttribute Like the way the option.None represents as null so you can defined your erased union

@robkuz if the implementation will be with CompilationRepresentationAttribute then you can create your own erased union ````fsharp [] type DU = A of 'a | B of 'b ````