dorbodwolf

3 ms·

1. 1.▲
   by dorbodwolf 2y ago

   Can’t sign up now
2. 2.▲
   by dorbodwolf 2y ago

   If our disk block and B-tree node is 16k, and our keys, values, and child pointers are all 8 bits, this means we could store 682 key/values with 683 child pointers per node. A three level tree could store over 300 million key/valu
3. 3.▲
   by dorbodwolf 3y ago

   I like this app, it’s support multilingual and multi currency types