From: | Josh Berkus <josh(at)agliodbs(dot)com> |
---|---|
To: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Global Sequences |
Date: | 2012-10-15 22:47:40 |
Message-ID: | 507C928C.7090805@agliodbs.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On 10/15/12 2:33 PM, Simon Riggs wrote:
> 3) Lazy allocation from the value space. When a node is close to
> running out of values, it requests a new allocation and coordinates
> with all nodes to confirm the new allocation is good.
>
> (3) is similar to the way values are allocated currently, so the only
> addition is a multi-node allocation algorithm to allocate new value
> ranges. That seems to be the best way to go. Any implementation for
> that presumes how the node configuration and inter-node transport
> works, which we would like to keep open for use by various external
> tools.
So you're talking about allocating a block of values for each node?
Seems straightforwards. That does mean that there needs to be a
"master" node in charge of the allocations, though, yes? How would this
be tooled/managed?
I'd also love to hear from the PostgresXC folks on whether this solution
works for them. Postgres-R too. If it works for all three of those
tools, it's liable to work for any potential new tool.
--
Josh Berkus
PostgreSQL Experts Inc.
http://pgexperts.com
From | Date | Subject | |
---|---|---|---|
Next Message | Andres Freund | 2012-10-15 23:01:07 | Re: [RFC][PATCH] wal decoding, attempt #2 - Design Documents (really attached) |
Previous Message | Christopher Browne | 2012-10-15 22:13:14 | Re: [RFC][PATCH] wal decoding, attempt #2 - Design Documents (really attached) |