The cost of an access is Therefore proportional into the duration of the key. Attempts can be compressed to get rid of intermediate nodes; this is named a patricia trie or radix tree. Radix trees can outperform balanced trees, particularly when a lot of keys share a typical prefix.It ought to be CPU-heavy to make brute drive attacks harder/impossib