aboutsummaryrefslogtreecommitdiff
path: root/src/backend/access/gist/gistscan.c
diff options
context:
space:
mode:
authorHeikki Linnakangas <heikki.linnakangas@iki.fi>2019-03-05 15:19:48 +0200
committerHeikki Linnakangas <heikki.linnakangas@iki.fi>2019-03-05 15:19:48 +0200
commitfe280694d0d49e3d5f2666042b5e9ff0c8305341 (patch)
tree99974f8c01cfb2f30f433814bb072840035dce30 /src/backend/access/gist/gistscan.c
parent35bc0ec7c800b303e0629913ac336924cf979dcc (diff)
downloadpostgresql-fe280694d0d49e3d5f2666042b5e9ff0c8305341.tar.gz
postgresql-fe280694d0d49e3d5f2666042b5e9ff0c8305341.zip
Scan GiST indexes in physical order during VACUUM.
Scanning an index in physical order is faster than walking it in logical order, because sequential I/O is faster than random I/O. The idea and code structure is borrowed from B-tree vacuum code. Patch by Andrey Borodin, with changes by me. Based on early work by Konstantin Kuznetsov, although the patch has been rewritten multiple times since his original version. Discussion: https://www.postgresql.org/message-id/1B9FAC6F-FA19-4A24-8C1B-F4F574844892%40yandex-team.ru
Diffstat (limited to 'src/backend/access/gist/gistscan.c')
0 files changed, 0 insertions, 0 deletions