design a centralized cycle search based on match query

[kabirkbr]

It is possible to issue a match query (which is by definition centralized) which will search for a certain pattern in a graph. A cycle (or path) can be expressed as such a pattern. This is already done with OfferNet.allPathsCentralized(Object similarityThreshold, int version=2) method. The problem is (and why it is not used in tests) is that in order to use match query, an exact length of the cycle which is being searched needs to be known -- which is OK for tests, but may not make a lot of sense in production.

Yet now I started to think that it actually may make sense to design a method which dynamically constructs match queries for different cycle lengths -- a query is simply a string and it should be possible to manipulate it with groovy / java String concatenation methods. This could expected to be much faster since it would go directly to DSE graph and leverage all the optimizations on that level...