"Ramy M.Hassan" <[EMAIL PROTECTED]> writes:
> I was wondering how index access methods reclaim the free disk pages after
> they are no longer used.
Btree and hash can both recycle unused pages, though neither is very
good about physically shrinking the file (neither can move existing
pages for in
I was wondering how index access methods reclaim the free disk pages after
they are no longer used.
I noticed that only btree access method uses the free space map. I couldn't
find in the source code of gist special handling for free pages ( like
maintaining a free list ). Does that mean that GiST