Skip to content
This repository has been archived by the owner on Oct 7, 2022. It is now read-only.

Anti-entropy inefficient #4

Open
Chat-Wane opened this issue Oct 22, 2014 · 0 comments
Open

Anti-entropy inefficient #4

Chat-Wane opened this issue Oct 22, 2014 · 0 comments

Comments

@Chat-Wane
Copy link
Owner

The current mechanism to get the missing elements of the document ( to catch up after being offline ) is inefficient. C.f. ./lib/application => getOperation.

Currently the complexity is k.n^2 where k is the average size of the identifier, n is the number of elements.

Could be improved using the whole pack of operations requested.
Could be improved with a direct access to the tail of identifiers.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Projects
None yet
Development

No branches or pull requests

1 participant