Implementing a Dynamic Compressed Trie


We present an order-preserving general purpose data structure for binary data, the LPC-trie. The structure is a highly 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… (More)


2 Figures and Tables

Slides referencing similar topics