This paper constructs a data structure to implement optimal looking up by alphabet tree based on probabilities of the prefix to be accessed.
本文针对前缀路由查询,根据前缀被访问的概率依据字母表树构建了一种基于概率的最优路由查询数据结构。
