Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

(more) performant memory storage #32

Open
heckj opened this issue Feb 12, 2023 · 0 comments
Open

(more) performant memory storage #32

heckj opened this issue Feb 12, 2023 · 0 comments
Assignees
Labels
enhancement New feature or request

Comments

@heckj
Copy link
Owner

heckj commented Feb 12, 2023

Look into using one of the newer pieces of swift collections, specifically the pending-1.1-release HashTreeCollections, which provides an optimized append-only structure that sounds like it would be lovely for the backing store of operations. (right now, it's just using Set<> which, while functional, might not provide the best operations for scaled up sets of data.

To verify the performance aspects, I think I'd want to bolster the benchmarks applied here, and seriously consider some of the classic CRDT benchmark structures, such as the string-sequence one that Martin Kleppmann (encoded at https://github.com/automerge/automerge-perf)

@heckj heckj added the enhancement New feature or request label Feb 12, 2023
@heckj heckj self-assigned this Feb 12, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant