Re: visualizing B-tree index coverage

From: "Dann Corbit" <DCorbit(at)connx(dot)com>
To: <tjo(at)acm(dot)org>, <pgsql-general(at)postgresql(dot)org>
Subject: Re: visualizing B-tree index coverage
Date: 2005-01-26 01:27:41
Message-ID: D425483C2C5C9F49B5B7A41F89441547055861@postal.corporate.connx.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

Some other things that are important:
How much is the data in transition (updates/deletes/inserts)? If the
data is mostly static or static you can add many special case indexes
with little penalty. The biggest cost of indexes (besides disk space
consumed) is in the slowdown of inserts, updates, and deletes. If the
data hardly changes, you can throw on index after index with little
cost. But if the data is in huge flux, you will have to be careful
about performance targets for each index you add.

This stuff may prove to be of great value:
http://www.postgresql.org/docs/8.0/interactive/monitoring-stats.html

I would also run EXPLAIN against every distinct sort of query you plan
to execute (unless it is for ad-hoc reporting in which case such a
requirement cannot be met).

Browse pgsql-general by date

  From Date Subject
Next Message Ron Mayer 2005-01-26 02:31:08 Re: Postgres+XML
Previous Message John DeSoi 2005-01-26 00:07:57 Re: EMBEDDED PostgreSQL