johnthescott
Joined 7 years ago
Karma
82
Submissions
294
Member since
Apr 11
bounty coder,
merchant of light
View on Hacker NewsJoined 7 years ago
tangentially, for dbs with large blobs, lot's of easy tricks when uuids are immutable digests.
syncing, say, two blob stores, A and B, boils down to jaccard metric, as a first order approximation
|(A ∩ B)| / |(A ∪ B)|
diffing the two digest sets at point in time is second order approximation.and don't forget logical replication ...