Does this mean that btrees no longer need regular reindexing? Or is there
more work to be done?
Chris
----- Original Message -----
From: "Tom Lane" <tgl@postgresql.org>
To: <pgsql-committers@postgresql.org>
Sent: Friday, February 21, 2003 8:06 AM
Subject: [COMMITTERS] pgsql-server/src backend/access/nbtree/Makefil ...
> CVSROOT: /cvsroot
> Module name: pgsql-server
> Changes by: tgl@postgresql.org 03/02/20 19:06:22
>
> Modified files:
> src/backend/access/nbtree: Makefile README nbtinsert.c nbtpage.c
> nbtree.c nbtsearch.c nbtsort.c
> src/backend/access/transam: rmgr.c xlog.c
> src/include/access: nbtree.h xlog.h
> src/include/catalog: catversion.h
> Added files:
> src/backend/access/nbtree: nbtxlog.c
>
> Log message:
> Make btree index structure adjustments and WAL logging changes needed to
> support btree compaction, as per proposal of a few days ago. btree index
> pages no longer store parent links, instead they have a level indicator
> (counting up from zero for leaf pages). The FixBTree recovery logic is
> removed, and replaced by code that detects missing parent-level insertions
> during WAL replay. Also, generate appropriate WAL entries when updating
> btree metapage and when building a btree index from scratch. I believe
> btree indexes are now completely WAL-legal for the first time.
> initdb forced due to index and WAL changes.
>
>
> ---------------------------(end of broadcast)---------------------------
> TIP 4: Don't 'kill -9' the postmaster
>
