Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
2013 Algorithmica  
The dynamic trie is a fundamental data structure with applications in many areas of computer science. This paper proposes a new technique for maintaining a dynamic trie T of size at most 2 w nodes under the unit-cost RAM model with a fixed word size w. It is based on the idea of partitioning T into a set of linked small tries, each of which can be maintained efficiently. Our method is not only space-efficient, but also allows the longest common prefix between any query pattern P and the
doi:10.1007/s00453-013-9836-6 fatcat:oequ4anh5fgyfexdltisqikwku