The CIDR list efficiently reduces route list capacity, but is not satisfied with the IP address lookup algorithm. 通过对基于哈希地址前缀长度的二分查找匹配算法的分析。
The MFIA_VTL algorithm finds maximum frequent itemsets through partitioning itemsets search space based on the prefix in the database with the vertical tid-list of transactions. 该算法针对数据库的垂直事务标识列表结构对项集搜索空间进行基于前缀的划分,来发现最大频繁项集。