{"push_id":2448305282,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"7f563c09f8901f6acd72cb8fba7b1bd3cf3aca8e","before":"51bc271790eb234a1ba4d14d3e6530f70de92ab5","commits":[{"sha":"7f563c09f8901f6acd72cb8fba7b1bd3cf3aca8e","author":{"name":"Andres Freund","email":"c6cbfe878b4ee67646e7630734db67f536518d54@anarazel.de"},"message":"Add amcheck verification of heap relations belonging to btree indexes.\n\nAdd a new, optional, capability to bt_index_check() and\nbt_index_parent_check():  check that each heap tuple that should have an\nindex entry does in fact have one.  The extra checking is performed at\nthe end of the existing nbtree checks.\n\nThis is implemented by using a Bloom filter data structure.  The\nimplementation performs set membership tests within a callback (the same\ntype of callback that each index AM registers for CREATE INDEX).  The\nBloom filter is populated during the initial index verification scan.\n\nReusing the CREATE INDEX infrastructure allows the new verification\noption to automatically benefit from the heap consistency checks that\nCREATE INDEX already performs.  CREATE INDEX does thorough sanity\nchecking of HOT chains, so the new check actually manages to detect\nproblems in heap-only tuples.\n\nAuthor: Peter Geoghegan\nReviewed-By: Pavan Deolasee, Andres Freund\nDiscussion: https://postgr.es/m/CAH2-Wzm5VmG7cu1N-H=nnS57wZThoSDQU+F5dewx3o84M+jY=g@mail.gmail.com","distinct":true,"url":"https://api.github.com/repos/postgres/postgres/commits/7f563c09f8901f6acd72cb8fba7b1bd3cf3aca8e"}]}
{"actor":{"display_login":"postgres-mirror"}}