Re: [HACKERS] Logical replication & corrupted pages recovery

2017-05-26 Thread Craig Ringer
On 27 May 2017 01:03, "Aleksander Alekseev" 
wrote:

Hi Konstantin,

> May be it is possible to somehow optimize it, by checking ranges of
primary
> key values

It's possible. An optimization you are looking for is called Merkle
tree [1]. Particularly it's used in Riak [2].

[1] https://en.wikipedia.org/wiki/Merkle_tree
[2] http://docs.basho.com/riak/kv/2.2.3/learn/concepts/active-anti-entropy/


Personally I'd very much value a solid, standalone resynchronization
function implemented in C using a PGconn. Even better if it could report
differences and/or apply local changes.


Re: [HACKERS] Logical replication & corrupted pages recovery

2017-05-26 Thread Aleksander Alekseev
Hi Konstantin,

> May be it is possible to somehow optimize it, by checking ranges of primary
> key values

It's possible. An optimization you are looking for is called Merkle
tree [1]. Particularly it's used in Riak [2].

[1] https://en.wikipedia.org/wiki/Merkle_tree
[2] http://docs.basho.com/riak/kv/2.2.3/learn/concepts/active-anti-entropy/

-- 
Best regards,
Aleksander Alekseev


signature.asc
Description: PGP signature