• H
    Introduce visibility map. The visibility map is a bitmap with one bit per · 608195a3
    Heikki Linnakangas 提交于
    heap page, where a set bit indicates that all tuples on the page are
    visible to all transactions, and the page therefore doesn't need
    vacuuming. It is stored in a new relation fork.
    
    Lazy vacuum uses the visibility map to skip pages that don't need
    vacuuming. Vacuum is also responsible for setting the bits in the map.
    In the future, this can hopefully be used to implement index-only-scans,
    but we can't currently guarantee that the visibility map is always 100%
    up-to-date.
    
    In addition to the visibility map, there's a new PD_ALL_VISIBLE flag on
    each heap page, also indicating that all tuples on the page are visible to
    all transactions. It's important that this flag is kept up-to-date. It
    is also used to skip visibility tests in sequential scans, which gives a
    small performance gain on seqscans.
    608195a3
vacuumlazy.c 32.7 KB