The traditional Aggregated Multicast was divided the problem into three sub-problems, namely, candidate tree generation, tree selection and group-to-tree mapping.
传统的聚合组播包括三个主要步骤，分别是候选树生成，树选择和组树匹配。
If the candidate page is found in the stable tree, then it is merged and the candidate page freed.
如果候选页面位于稳定树中，则该页面被合并，候选页面被释放。
In the mining procedure no candidate generation is required, and only one time, we can obtain all the continuous access paths that take the root of IWAP-Tree as suffix.
采用这种方法进行挖掘，无需生成候选集，而且一次就可以挖掘出所有以根节点为后缀的连续频繁访问路径。
In the mining procedure no candidate generation is required, and only one time, we can obtain all the continuous access paths that take the root of IWAP-Tree as suffix.
采用这种方法进行挖掘，无需生成候选集，而且一次就可以挖掘出所有以根节点为后缀的连续频繁访问路径。
应用推荐