> On 27 Feb 2026, at 14:54, Madhav Madhusoodanan <madhavmadhusoodanan@gmail.com> wrote:
>
>
> On a related note, I noticed the same topic on the 2026 projects list
> in the Google Summer of Code page. It mentions that a prototype
> extension (pg_btree_compact) has been developed. How do I access the
> same?
Hi Madhav!
It's available here [0], it's only a prototype.
But the approach with AccessExclusiveLock is not practically useful.
Just REINDEX INDEX CONCURRENTLY will do better in most cases.
We have to develop locking and pining protocols that:
1. Allow both Forward and Backward scans
2. Have indistinguishable locking and pining effect on index
Perhaps, I agree with Pavlo that it seems overly rigorous for GSoC.
It's more like math research than code typing.
Thanks for your interest!
Best regards, Andrey Borodin.
[0] https://github.com/x4m/postgres_g/commit/a5eea2d
