Tries are popular data structures for storing a set of strings, where common
prefixes are represented by common root-to-node paths. Over fifty years of
usage have produced many variants and implementations to overcome some of their
limitations. We explore new succinct representations of path-decomposed tries
and experimentally evaluate the corresponding reduction in space usage and
memory latency, comparing with the state of the art.