Skip site navigation (1) Skip section navigation (2)

Peripheral Links

Header And Logo

PostgreSQL
| The world's most advanced open source database.

Site Navigation

Search for
  Advanced Search

Re: Unsplitting btree index leaf pages


  • From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
  • To: Kevin Brown <kevin(at)sysexperts(dot)com>
  • Cc: pgsql-hackers(at)postgresql(dot)org
  • Subject: Re: Unsplitting btree index leaf pages
  • Date: Sat, 24 Dec 2005 21:01:27 -0500
  • Message-id: <22873(dot)1135476087(at)sss(dot)pgh(dot)pa(dot)us>

Kevin Brown <kevin(at)sysexperts(dot)com> writes:
> Well, REINDEX is apparently a very expensive operation right now.  But
> how expensive would it be to go through the entire index and perform
> the index page merge operation being discussed here, and nothing else?
> If it's fast enough, might it be worthwhile to implement just this
> alone as a separate maintenance command (e.g., VACUUM INDEX) that
> acquires the appropriate lock (AccessExclusive, I'd expect) on the
> index to prevent exactly the issues you're concerned about?
> If it's fast enough even on large tables, it would be a nice
> alternative to REINDEX, I'd think.

This would work, but it's hard to tell if it'd be worthwhile short
of actually doing an implementation and field-testing it ...

			regards, tom lane



Home | Main Index | Thread Index

Privacy Policy | PostgreSQL Archives hosted by Command Prompt, Inc. | Designed by tinysofa
Copyright © 1996 – 2008 PostgreSQL Global Development Group