It puts forward two algorithms which are data mining algorithm based on prefer linking list and frequent pattern growth tree to produce association rules so as to improve the mining efficiency which is reduced by so many indexing database . it proves their effectiveness of these two strategies in theory . the two algorithms only scan database two times 提出了基于前缀广义链表的关联规则生成算法和基于频繁模式增长的关联规则挖掘算法，这两种算法只需扫描数据库两次，而且不需要产生过多的候选频繁项集，这样不仅提高了算法的运行效率，而且节约了内存空间。
