I am new to judy and i dont know if it is what i need.
I need a Map (associative array) with a string as the key to do fast lookup in ram.
I dont need insertion deletion .. to be fast.

How judy compare to a burst-trie , HAT-trie and HashTrie.