Commit 4b618101 authored by Julien Muchembled's avatar Julien Muchembled


git-svn-id: 71dcc9de-d417-0410-9af5-da40c76e7ee4
parent 1ef149c2
......@@ -93,7 +93,7 @@ How to use
b. Just create the storage object and play with it:
from neo.client.Storare import Storage
from neo.client.Storage import Storage
s = Storage(master_nodes="", name="main")
......@@ -32,7 +32,7 @@ CHECK_REPLICATE = 1
Replication algorythm
Replication algorithm
Purpose: replicate the content of a reference node into a replicating node,
bringing it up-to-date.
......@@ -46,7 +46,7 @@ partitions.
- Transaction (metadata) replication
- Object (data) replication
Both part follow the same mechanism:
Both parts follow the same mechanism:
- On both sides (replicating and reference), compute a checksum of a chunk
(RANGE_LENGTH number of entries). If there is a mismatch, chunk size is
reduced, and scan restarts from same row, until it reaches a minimal length
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment