Can somebody expand more on the semantics of OR queries: https://www.cockroachlabs.com/docs/stable/known-limitations.html#query-planning-for-or-expressions
If I query for a > 1 OR b > 1, with appropriate indexes, does this not do 2 simultaneous scans of the a index and b index, both ascending and starting at 1? What if I have a more complicated query that is a long series of
(cond1 AND cond2) OR (cond3 AND cond4) OR ... OR (condN AND condN+1)
Does this become an extremely expensive query, even with appropriate indexes?
If that’s not the case, is there a github issue open to improve this? I can’t seem to find one.