From: | Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us> |
---|---|
To: | Zeugswetter Andreas SB SD <ZeugswetterA(at)spardat(dot)at> |
Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Jeff Davis <jdavis-pgsql(at)empires(dot)org>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Why hash indexes suck |
Date: | 2004-06-10 03:35:04 |
Message-ID: | 200406100335.i5A3Z4w07634@candle.pha.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Added to TODO:
* Order heap pointers on hash index pages by hash value and ctid
---------------------------------------------------------------------------
Zeugswetter Andreas SB SD wrote:
>
> > We could safely sort on the hash value, but I'm not sure how effective
> > that would be, considering that we're talking about values that already
> > hashed into the same bucket --- there's likely not to be very many
> > distinct hash values there.
>
> I think we can safely put that on the todo list.
> The existing hash algorithm is very good. So I would on the
> contrary beleive that only a few keys share a hash value per pagesized bucket.
> For the equal keys case it does not matter since we want all of the rows anyways.
> For the equal hash value case it would probably be best to sort by ctid.
>
> TODO ?: order heap pointers inside hash index pages by hash value and ctid
>
> Andreas
>
> ---------------------------(end of broadcast)---------------------------
> TIP 8: explain analyze is your friend
>
--
Bruce Momjian | http://candle.pha.pa.us
pgman(at)candle(dot)pha(dot)pa(dot)us | (610) 359-1001
+ If your life is a hard drive, | 13 Roberts Road
+ Christ can be your backup. | Newtown Square, Pennsylvania 19073
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2004-06-10 03:59:19 | Re: Why hash indexes suck |
Previous Message | Bruce Momjian | 2004-06-10 02:36:33 | Re: Tablespaces |