| From: | Heikki Linnakangas <heikki(at)enterprisedb(dot)com> |
|---|---|
| To: | Cui Shijun <rancpine(at)gmail(dot)com> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Fwd: How does the partitioned lock manager works? |
| Date: | 2007-04-28 09:37:32 |
| Message-ID: | 463315DC.50108@enterprisedb.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Cui Shijun wrote:
> As the insertion algorithm described, a specific partition lock manage some
> items, but these items can be stored in anywhere of the hash table,not
> necessarily in a bucket chain.
> So there are some problems with "different partitions use different hash
> chains",
> a partition can use different hash chains,too. Am I right?
No, you're still confused. Each bucket in the hash table is a chain.
Each chain can have 0, 1, or more items.
I'd suggest that you study how the normal non-partitioned hash tables
work first. The partitioning is a straightforward extension of that.
--
Heikki Linnakangas
EnterpriseDB http://www.enterprisedb.com
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Simon Riggs | 2007-04-28 10:13:19 | Re: Avoiding unnecessary reads in recovery |
| Previous Message | Cui Shijun | 2007-04-28 09:25:18 | Re: Fwd: How does the partitioned lock manager works? |