An Experimental Study of Compression Methods for Dynamic Tries

We study an order‐preserving general purpose data structure for binary data, the LPC‐trie. The structure is a compressed trie, using both level and path compression. The memory usage is similar to that of a balanced binary search tree, but the expected average depth is smaller. The LPC‐trie is well suited to modern language environments with efficient memory allocation and garbage collection. We present an implementation in the Java programming language and show that the structure compares favorably with a balanced binary search tree.