| From: | Pailloncy Jean-Gerard <jg(at)rilk(dot)com> |
|---|---|
| To: | Hannu Krosing <hannu(at)tm(dot)ee> |
| Cc: | pgsql(at)mohawksoft(dot)com, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>, "Victor Y(dot) Yegorov" <viy(at)mits(dot)lv> |
| Subject: | Re: bitmap AM design |
| Date: | 2005-03-04 08:38:29 |
| Message-ID: | 80e9e161701af8ca4cf0acb7e8e873f2@rilk.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Le 2 mars 05, à 21:17, Hannu Krosing a écrit :
> Ühel kenal päeval (teisipäev, 1. märts 2005, 14:54-0500), kirjutas
> pgsql(at)mohawksoft(dot)com:
>> Now, it occurs to me that if my document reference table can refer to
>> something other than an indexed primary key, I can save a lot of index
>> processing time in PostgreSQL if I can have a "safe" analogy to CTID.
>
> I guess you could work on making hash indexes better (for concurrent
> access).
You should have a look to this thread
http://archives.postgresql.org/pgsql-hackers/2005-02/msg00263.php
Take a look at this paper about "lock-free parallel hash table"
http://www.cs.rug.nl/~wim/mechver/hashtable/
> 'a "safe" analogy to CTID' looks remarkably like hash index
>
> --
> Hannu Krosing <hannu(at)tm(dot)ee>
Cordialement,
Jean-Gérard Pailloncy
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Neil Conway | 2005-03-04 09:47:03 | Re: bitmap AM design |
| Previous Message | Aaron Birkland | 2005-03-04 06:05:37 | Re: Solving hash table overrun problems |