RE: Number of buckets/partitions of dshash
| От | Ideriha, Takeshi |
|---|---|
| Тема | RE: Number of buckets/partitions of dshash |
| Дата | |
| Msg-id | 4E72940DA2BF16479384A86D54D0988A6F1EE1CD@G01JPEXMBKW04 обсуждение исходный текст |
| Ответ на | Re: Number of buckets/partitions of dshash (Kyotaro HORIGUCHI <horiguchi.kyotaro@lab.ntt.co.jp>) |
| Список | pgsql-hackers |
>From: Kyotaro HORIGUCHI [mailto:horiguchi.kyotaro@lab.ntt.co.jp] >> This would cause some waste of memory on DSA because some partitions (buckets) >is allocated but not used. >> >> So I'm thinking that current dshash design is still ok but flexible >> size of partition is appropriate for some use cases like mine. >> >> Do you have any thoughts? > >We could do that easily, but shouldn't we find a way to reduce or eliminate the impact >of locking first? dshash needs to hold partition lock while the caller is examining a >returned entry. Thanks for the comment. I agreed. It would take a long time to achieve it but as you've pointed out finding way to minimize the locking time seems benefit for everyone and first priority. Regards, Takeshi Ideriha
В списке pgsql-hackers по дате отправления: