Backwards suffix trees (Bell et al., 1990;Stolcke, 2002;Germann et al., 2009) are among the most efficient representations of tries for language models.
hash-based LM such as KenLM probing would repeat queries until finding truncated ngram histories in the trie.