From: | Peter Geoghegan <pg(at)bowt(dot)ie> |
---|---|
To: | Alexander Korotkov <a(dot)korotkov(at)postgrespro(dot)ru> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Improve search for missing parent downlinks in amcheck |
Date: | 2019-07-19 00:20:53 |
Message-ID: | CAH2-WznRmQHd0KegAXjossKJsytZE8HjT4B_6ZHPfxsXx8i6Pg@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Tue, Apr 30, 2019 at 5:58 PM Peter Geoghegan <pg(at)bowt(dot)ie> wrote:
> I will think about a simple fix, but after the upcoming point release.
> There is no hurry.
Attached draft patch uses RelationGetNumberOfBlocks() to size each of
the two Bloom filters that may be used by amcheck to perform
verification.
The basic heapallindexed Bloom filter is now sized based on the
conservative assumption that there must be *at least*
"RelationGetNumberOfBlocks() * 50" elements to fingerprint (reltuples
will continue to be used to size the basic heapallindexed Bloom filter
in most cases, though). The patch also uses the same
RelationGetNumberOfBlocks() value to size the downlink Bloom filter.
This second change will fix your problem very non-invasively.
I intend to backpatch this to v11 in the next few days.
--
Peter Geoghegan
Attachment | Content-Type | Size |
---|---|---|
0001-Set-minimum-amcheck-Bloom-filter-size.patch | application/octet-stream | 2.0 KB |
From | Date | Subject | |
---|---|---|---|
Next Message | Michael Paquier | 2019-07-19 00:35:29 | Re: Add parallelism and glibc dependent only options to reindexdb |
Previous Message | Michael Paquier | 2019-07-19 00:19:19 | Re: Bad canonicalization for dateranges with 'infinity' bounds |