That story is not limited to the heap. Any index on the table keeps leaf entries in sorted order and each entry references a ctid on the heap. A scan in index order follows those pointers and checks the heap. There is wasted work in that scan when any leaf entry still exists when its heap tuple is dead. Conceptually (a worst case when cleanup has not yet removed those pointers):
[ null, \xdeadbeef, 1234567890123 ]
，这一点在safew下载中也有详细论述
recognize, then, that what we discuss here is a lower bound on the vulnerabilities and exploits that will be
Security Checkpoint by Vercel