Good Morning NOSTR
Enjoy free speech while your parents aren't here
Soooo, i did it, currently i am undergoing heavy testing to ensure no memory leakage and graceful shutdowns
then after that i will hold a comparison between IDB and OPFS versions to see which is more suitable for the final product
Anyway, the next step in building a strong client foundation is a Global Strings Dictionary
What is that good for?
1- every single chars sequence will be Log(n) searchable
2- a string will never be stored twice (all 'GM' notes will be stored as a single string "GM" and the Global Dictionary job is to map it to where it appears)
Why so ambitious?
technically if you have a strings search dictionary you already achieved the compression part (zero storage redundancy)
i am imagining something like a radix tree
but a global one where any underlying result is a subtree of categorized results
View quoted note โ
Radix tree - Wikipedia

