"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 ?
Feel free to reimplement the theorem-prover, taking special care to
be able to prove things about operators that you have zero information
about the semantics of.
The reason the prover works with btree-indexable operators is that
it can infer a lot of semantics from the index opclass relationships.
This has nothing to do with whether the index itself is btree or not,
let alone whether the variables used in the predicate are in the index.
It's just a way to do something useful within a reasonable amount of
code.
regards, tom lane