# 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, +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

#### Explore Further: Topics Discussed in This Paper

Dynamic Packed Compact Tries Revisited
5
Balancing Straight-Line Programs
• Computer Science, Mathematics
• 2019
13

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 84 REFERENCES