Re: [REVIEW] Re: Compression of full-page-writes
От | Andres Freund |
---|---|
Тема | Re: [REVIEW] Re: Compression of full-page-writes |
Дата | |
Msg-id | 20140912203119.GC23806@awork2.anarazel.de обсуждение исходный текст |
Ответ на | Re: [REVIEW] Re: Compression of full-page-writes (Heikki Linnakangas <hlinnakangas@vmware.com>) |
Список | pgsql-hackers |
On 2014-09-12 22:38:01 +0300, Heikki Linnakangas wrote: > It's worth noting that there are faster CRC implementations out there than > what we use. The Slicing-by-4 algorithm was discussed years ago, but was not > deemed worth it back then IIRC because we typically calculate CRC over very > small chunks of data, and the benefit of Slicing-by-4 and many other > algorithms only show up when you work on larger chunks. But a full-page > image is probably large enough to benefit. I've recently pondered moving things around so the CRC sum can be computed over the whole data instead of the individual chain elements. I think, regardless of the checksum algorithm and implementation we end up with, that might end up as a noticeable benefit. Greetings, Andres Freund -- Andres Freund http://www.2ndQuadrant.com/PostgreSQL Development, 24x7 Support, Training & Services
В списке pgsql-hackers по дате отправления: