From: | Bruno Wolff III <bruno(at)wolff(dot)to> |
---|---|
To: | Jeff Boes <jboes(at)nexcerpt(dot)com> |
Cc: | pgsql-general(at)postgresql(dot)org |
Subject: | Re: Table partitioning for maximum speed? |
Date: | 2003-10-09 19:01:57 |
Message-ID: | 20031009190157.GA14336@wolff.to |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
On Thu, Oct 09, 2003 at 18:37:19 +0000,
Jeff Boes <jboes(at)nexcerpt(dot)com> wrote:
> I'm sure this is a concept that's been explored here. I have a table
> (fairly simple, just two columns, one of which is a 32-digit checksum)
> with several million rows (currently, about 7 million). About a million
> times a day we do
>
> select * from my_table where md5 = ?
>
> to verify presence or absence of the row, and base further processing on
> that information.
>
> The idea bandied about now is to partition this table into 16 (or 256,
> or ...) chunks by first digit (or 2, or ...). In the simplest case, this
> would mean:
If there is an index on the checksum column, then you shouldn't get
much of a speed up by partitioning the data.
If you don't have an index on the checksum, it sounds like you should.
From | Date | Subject | |
---|---|---|---|
Next Message | Bruno Wolff III | 2003-10-09 19:05:36 | Re: [SQL] SQL query problem |
Previous Message | jearl | 2003-10-09 18:57:53 | Re: Response from MySql AB (Re: Humor me: Postgresql vs. |