"Zeugswetter Andreas SB SD" <ZeugswetterA@spardat.at> writes:
>> Since bid is not in an index the evaluation of usability obviously
>> should not be based on index ops ?
Actually, now that I think about it, there's no reason that the prover
couldn't try a simple equal() on a WHERE clause and predicate clause
before moving on to the btree-semantics-based tests. If the clauses
are statically identical then one implies the other, no? This would
work nicely for clauses like IS [NOT] NULL, and would give us at least a
little bit of ability to deal with non-btree operator clauses.
regards, tom lane
