Hi @matthewhammer,
Just to follow up your statement:
For relational data, I would use nested Tries (the 2D and 3D versions, or deeper if necessary. The TrieMap module provides a wrapper that may get in the way for now.)
What do you mean by trie map provides a wrapper that may get in your way?
Also to piggyback on this thread with some questions:
Based on your CRUD example, I found mappings and abstractions quite straightforward using variants so thank you for that.
Now say I go with a huge trie and want to migrate a 200GB relational db into a 3D TrieMap.
- Is there a limit cap I need to be aware of?
- Does the size of trie affects the update query time? Right now it’s about 2 seconds.
- Is this the best way to migrate a database?
Also the last question how does Motoko Trie compares with ethereum modified Merkle Patricia Trie? ( I’m trying to achieve same idea that each node is referenced by its hash, which is used for lookups in a leveldb database ).
Thanks,
Gabriel