Martijn van Oosterhout <kleptog@svana.org> writes:
> Well, for these two:
> * For Highly Non-Unique Data we can use Duplicate Compression
> * Multi-Column Leading Value Compression - if you have a multi-column
> You don't need any new logic at all. If _bt_compare says they're equal
> you can compact them.
Not if you'd like to support index key retrieval. (The equality
function that btree is using doesn't necessarily mean "equal for all
purposes".)
regards, tom lane
