Top Tree Compression of Tries

@inproceedings{Bille2019TopTC,
  title={Top Tree Compression of Tries},
  author={P. Bille and Inge Li G{\o}rtz and Pawel Gawrychowski and G. Landau and Oren Weimann},
  booktitle={ISAAC},
  year={2019}
}
  • P. Bille, Inge Li Gørtz, +2 authors Oren Weimann
  • Published in ISAAC 2019
  • Computer Science, Mathematics
  • We present a compressed representation of tries based on top tree compression [ICALP 2013] that works on a standard, comparison-based, pointer machine model of computation and supports efficient prefix search queries. Namely, we show how to preprocess a set of strings of total length $n$ over an alphabet of size $\sigma$ into a compressed data structure of worst-case optimal size $O(n/\log_\sigma n)$ that given a pattern string $P$ of length $m$ determines if $P$ is a prefix of one of the… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 84 REFERENCES
    Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
    8
    Improved Practical Compact Dynamic Tries
    13
    Random Access to Grammar-Compressed Strings and Trees
    62
    Compressed Indexing with Signature Grammars
    15
    Improved Grammar-Based Compressed Indexes
    66
    Slowing Down Top Trees for Better Worst-Case Compression
    7
    Dynamic Packed Compact Tries Revisited
    5
    Fast Algorithms for Finding Nearest Common Ancestors
    1075
    Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
    558
    Dynamic Index and LZ Factorization in Compressed Space
    20