Ask HN: Why Do In-Memory DBs Use ART or HOT vs. Hash Array Mapped Tries?

Hi all,<p>can anyone explain why HAMT and derivates are not used in main memory database systems, but rather B+&#x2F;Bw tree indexes or for instance tries based on different node sizes as for instance the ART (Adaptive Radix Tree) ot HOT (Height Optimized Trie)?<p><pre><code> - https:&#x2F;&#x2F;db.in.tum.de&#x2F;~leis&#x2F;papers&#x2F;ART.pdf - https:&#x2F;&#x2F;dbis-informatik.uibk.ac.at&#x2F;sites&#x2F;default&#x2F;files&#x2F;2018-06&#x2F;hot-height-optimized.pdf </code></pre> I mean the HAMT also focuses on the same problem domain (BitSet + population count operation), that is reducing storage space consumption and being cache oblivious in comparison with ART and HOT. Binary comparable keys can be constructed as well.<p>You could even combine the trie variants.<p>kind regards<p>Johannes