https://arxiv.org/abs/2504.00828
Use hash collision resovle method can mitigate the memory usage in random scenario. But the method is still under development and not tested.
for example: let the Max Capacity of the LAT is 8, if we want to store random number from 0 - 63. In worst case in the primary LAT, we need 64 element space, and most of them are empty.
use Hash Map approach: we only have 8 node in data level, but we store n to n % 8, if there already has data, we use a linked list point down like Hash Map.
The method is under research, and expect a new version of paper will be publish.
2025/7/26
Red-Black Tree: C++ STL map
B Tree: https://github.com/tlx/tlx