diff options
| author | Heikki Linnakangas <heikki.linnakangas@iki.fi> | 2015-02-10 10:54:40 +0200 |
|---|---|---|
| committer | Heikki Linnakangas <heikki.linnakangas@iki.fi> | 2015-02-10 10:54:40 +0200 |
| commit | 025c02420de990c15a90e9e3f86fcfbc5b59ee88 (patch) | |
| tree | 6846db66dc802c4f4a955b887866c13ddcb1cebc /src/interfaces/ecpg/test/expected/sql-array.c | |
| parent | cc761b170c5e7b4ef22ed918f4785ec1fabe62cd (diff) | |
| download | postgresql-025c02420de990c15a90e9e3f86fcfbc5b59ee88.tar.gz postgresql-025c02420de990c15a90e9e3f86fcfbc5b59ee88.zip | |
Speed up CRC calculation using slicing-by-8 algorithm.
This speeds up WAL generation and replay. The new algorithm is
significantly faster with large inputs, like full-page images or when
inserting wide rows. It is slower with tiny inputs, i.e. less than 10 bytes
or so, but the speedup with longer inputs more than make up for that. Even
small WAL records at least have 24 byte header in the front.
The output is identical to the current byte-at-a-time computation, so this
does not affect compatibility. The new algorithm is only used for the
CRC-32C variant, not the legacy version used in tsquery or the
"traditional" CRC-32 used in hstore and ltree. Those are not as performance
critical, and are usually only applied over small inputs, so it seems
better to not carry around the extra lookup tables to speed up those rare
cases.
Abhijit Menon-Sen
Diffstat (limited to 'src/interfaces/ecpg/test/expected/sql-array.c')
0 files changed, 0 insertions, 0 deletions