Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane +1

In this paper, we present a new data structure called the packed compact trie (packed c-trie) which stores a set $S$ of $k$ strings of total length $n$ in $n\log \sigma +O(k\log n)$ bi…