From: | Hannu Krosing <hannu(at)skype(dot)net> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | Gregory Stark <stark(at)enterprisedb(dot)com>, Kenneth Marshall <ktm(at)rice(dot)edu>, pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Hash index todo list item |
Date: | 2007-09-06 13:59:52 |
Message-ID: | 1189087192.7470.16.camel@hannu-laptop |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Ühel kenal päeval, N, 2007-09-06 kell 09:38, kirjutas Tom Lane:
> Hannu Krosing <hannu(at)skype(dot)net> writes:
> > Ühel kenal päeval, E, 2007-09-03 kell 19:55, kirjutas Tom Lane:
> >> No, because part of the deal is that you can do lookups using only the
> >> leading index columns. At least, all the existing multicolumn index
> >> types can do that.
>
> > One approahc is not to mix hashes, but to partition the hash, so that
> > each column gets its N bits in the hash.
>
> How does that help? You still need all the keys to find out which
> bucket to look in.
no. you need to look at only the buckets where that part of hash matches
say you allocate bits 4-7 for column 2 and then need to look up column 2
value with hash 3 . here you need to look at only buckets N*16 + 3, that
is, you need to examine only each 16th bucket
---------
Hannu
From | Date | Subject | |
---|---|---|---|
Next Message | Hannu Krosing | 2007-09-06 14:08:05 | Re: [FEATURE REQUEST] Streaming Onlinebackup (Maybe OFFTOPIC) |
Previous Message | Tom Lane | 2007-09-06 13:38:18 | Re: Hash index todo list item |