Message-ID: <451C8E35.7000906@canonical.com>
Date: Thu, 28 Sep 2006 22:08:37 -0500
From: Matthew Nuzum <matthew.nuzum@canonical.com>
User-Agent: Thunderbird 1.5.0.7 (X11/20060922)
MIME-Version: 1.0
To: Carlo Stonebanks <stonec.register@sympatico.ca>
CC: pgsql-performance@postgresql.org
Subject: Re: Performace Optimization for Dummies
References: <efgu4v$276m$1@news.hub.org>
	<b42b73150609281017m7f8f9d86xfa32d38cec954af7@mail.gmail.com>
	<efh26m$2fd$1@news.hub.org> <451C18BE.8050908@canonical.com>
	<efhdcr$2873$1@news.hub.org>
In-Reply-To: <efhdcr$2873$1@news.hub.org>
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit

Carlo Stonebanks wrote:
> Lots of great info here, I will see what applies to my situation. However, I 
> don't see bulk inserts of the tables working, because all of the tables need 
> to be refreshed as values to deduplicate and match will change with every 
> row added. In order for this to work, i would have to write queries against 
> the hash tables. This is where something like MySQL's in-memory tables would 
> have come in handy...
> 
> What is GDB?
> 
> Carlo

Sorry, meant GDBM (disk based hash/lookup table).

With Postgres if your tables fit into RAM then they are in-memory as
long as they're actively being used.

Hashtables and GDBM, as far as I know, are only useful for key->value
lookups. However, for this they are *fast*. If you can figure out a way
to make them work I'll bet things speed up.
-- 
Matthew Nuzum
newz2000 on freenode