4 ms·
Use this as a key value store in memory if you are working in C for speed. I've used this to handle multiple 200+ million entry tables in memory, that were not
by throwaway313313 4y ago
Use this as a key value store in memory if you are working in C for speed. I've used this to handle multiple 200+ million entry tables in memory, that were not able to be handled as effectively using SQL.
Consider using this if you need to intersect very large data sets that otherwise would take a prohibitive amount of time to even insert into an SQL database (with or without an index) or otherwise even handle in a script language.
- morelisp 4y agoNo, use an LSM.
- pxeger1 4y agoLSM: https://en.wikipedia.org/wiki/Log-structured_merge-tree https://en.wikipedia.org/wiki/Log-structured_merge-tree
- lelanthran 4y ago> No, use an LSM. What is an LSM?
- pclmulqdq 4y agoLSM trees are mostly for persistent storage. You can do a lot better in memory with a btree or a different data structure. LSM trees have a lot of operations that need multiple scans or are O(n) instead of O(log n).
- deleted 4y ago[deleted]
- ww520 4y agoJudy Arrays would be faster than LSM.