News for hackers. Stuff that matters.
Re:Faster DISTINCT queries on PostgreSQL by knuthsat on Friday May 07, 2021 @06:45AM (#27074464)
If index is ordered, I imagined it as a flat array. I would go to the next bigger item using binary search. I guess SkipScan does a similar thing but the index is a btree.

Of course, things get more complicated when more tuples need to be distinct but I was a bit confused as to why the ordered property was not exploited by PG before (and still is not).

There are no comments on this comment yet.