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.

Sign up for GitHub

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

Investigate using own data structures #68

Open

peterhil opened this issue Jun 11, 2021 · 0 comments

Assignees

Labels

epic prio: gambling technical

Owner

peterhil commented Jun 11, 2021 •

edited

Loading

Use own data structures to hold bookmarks and categories

Pros:

Enables implementing features more easily
Enables more advanced features
Acts as a cache to speed up operations
Helps with testing

Cons:

Cache invalidation is hard

Data structures to consider:

Storage of category structure: Adjacency lists or binary trees
Searching categories: Tries or bloom filters for
Searching bookmarks
Sorting bookmarks with different criteria
CRDTs with automerge

peterhil created this issue from a note in Robustness (To do)

peterhil changed the title ~~Use own data structures~~ Investigate using own data structures

peterhil self-assigned this

peterhil added technical prio: gambling epic labels

peterhil removed this from To do in Robustness

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment