Re: Logical replication & corrupted pages recovery

From: Craig Ringer <craig(dot)ringer(at)2ndquadrant(dot)com>
To: Aleksander Alekseev <a(dot)alekseev(at)postgrespro(dot)ru>
Cc: PostgreSQL Hackers <pgsql-hackers(at)postgresql(dot)org>, konstantin knizhnik <k(dot)knizhnik(at)postgrespro(dot)ru>
Subject: Re: Logical replication & corrupted pages recovery
Date: 2017-05-27 00:42:27
Message-ID: CAMsr+YHrN8Agpg+ZsYRCA3HkhzQ3=jDAAHMn6eiwQJ4yJBAQuw@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 27 May 2017 01:03, "Aleksander Alekseev" <a(dot)alekseev(at)postgrespro(dot)ru>
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.

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Michael Paquier 2017-05-27 01:41:06 Re: Extra Vietnamese unaccent rules
Previous Message Petr Jelinek 2017-05-27 00:29:56 Re: ALTER SUBSCRIPTION ..SET PUBLICATION <no name> refresh is not throwing error.