| From: | Heikki Linnakangas <hlinnakangas(at)vmware(dot)com> |
|---|---|
| To: | Abhijit Menon-Sen <ams(at)2ndQuadrant(dot)com> |
| Cc: | Fujii Masao <masao(dot)fujii(at)gmail(dot)com>, Robert Haas <robertmhaas(at)gmail(dot)com>, Rahila Syed <rahilasyed90(at)gmail(dot)com>, Andres Freund <andres(at)2ndquadrant(dot)com>, Rahila Syed <rahilasyed(dot)90(at)gmail(dot)com>, <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | CRC algorithm (was Re: [REVIEW] Re: Compression of full-page-writes) |
| Date: | 2014-09-12 20:03:00 |
| Message-ID: | 54135174.2030503@vmware.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 09/12/2014 10:54 PM, Abhijit Menon-Sen wrote:
> At 2014-09-12 22:38:01 +0300, hlinnakangas(at)vmware(dot)com wrote:
>>
>> We probably should consider switching to a faster CRC algorithm again,
>> regardless of what we do with compression.
>
> As it happens, I'm already working on resurrecting a patch that Andres
> posted in 2010 to switch to zlib's faster CRC implementation.
As it happens, I also wrote an implementation of Slice-by-4 the other
day :-). Haven't gotten around to post it, but here it is.
What algorithm does zlib use for CRC calculation?
- Heikki
| Attachment | Content-Type | Size |
|---|---|---|
| slice-by-4.patch | text/x-diff | 12.3 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Peter Geoghegan | 2014-09-12 20:08:21 | Re: Stating the significance of Lehman & Yao in the nbtree README |
| Previous Message | Abhijit Menon-Sen | 2014-09-12 19:54:03 | Re: [REVIEW] Re: Compression of full-page-writes |