算法采用了深度优先挖掘策略，并将基于前缀序列格的深度优先遍历与两种高效的剪枝策略相结合。
The search strategy of our algorithm integrates a depth-first traversal of the prefix sequence lattice with two effective pruning mechanisms.
Scan——对元素序列上执行扫描(包含前缀的求和)。
Scan - "Peforms a scan (inclusive prefix sum) on a sequence of elements."
结果应该是一个字典，从前缀到一个可能的后缀组成的序列的映射。
The result should be a dictionary that maps from prefixes to a collection of possible suffixes.
该算法构造了前缀树表示序列模式，并用广度剪枝和深度剪枝维护该前缀树的结构。
It constructs a prefix tree to represent the sequence patterns, and continuously maintains the tree structure by using width pruning and depth pruning.
代码字由前缀和尾部组成，用前缀表明编码的序列类型。
The code word consists of prefix and tail, the scheme USES prefix to indicate the type of sequence.
本主题介绍在序列化xml树时如何控制命名空间前缀。
This topic describes how you can control namespace prefixes when serializing an XML tree.
本主题介绍在序列化xml树时如何控制命名空间前缀。
This topic describes how you can control namespace prefixes when serializing an XML tree.
应用推荐