Jim,
On 7/28/06 12:27 PM, "Jim C. Nasby" <[EMAIL PROTECTED]> wrote:
> In that case, perhaps this is something Greenplum might be interested
> in, since it might fit nicely between bitmap and btree indexes.
I'm certainly following the thread.
We have talked about hash and btree organized tables both here, but haven't
gotten far enough along to evaluate what's already there in pg.
Looks like this thread has nicely characterized the problems with what's
there.
WRT hashing - we use FNV hash which is a very nice, very fast modern hash
algorithm. We would contribute that if we worked on this.
- Luke
---------------------------(end of broadcast)---------------------------
TIP 1: if posting/reading through Usenet, please send an appropriate
subscribe-nomail command to [EMAIL PROTECTED] so that your
message can get through to the mailing list cleanly
