You can create the SQL management repository along with your transaction database used in production.
您可以使用生产中的事务数据库创建SQL管理存储库。
Discovering the frequent set of item sequences in a transaction database is one of the most important tasks in mining association rules.
最大频繁项目序列集的生成是影响关联规则挖掘的关键问题，传统的算法是通过对事务数据库的多次扫描实现的。
Association rule and sequential pattern techniques are the methods that study and find the relationship in the items of transaction database.
关联规则和序列模式是研究和发现事务数据库中数据项之间的相关性的方法。
The MFP algorithm can convert a transaction database into a MFP tree through scanning the database only once, and then do the mining of the tree.
MFP算法能在一次扫描事务数据库过程中，把该数据库转换成MFP树，然后对MFP树进行关联规则挖掘。
Its main research object is the transaction database, its essential target is to discover whether there is certain connection relation between items in transaction database.
关联规则的主要研究对象是交易数据库，其主要目标就是发现交易数据库中交易项目之间是否存在某些关联关系。
In this paper, we mainly discuss a new method-to find a maximum frequent set based on the mining of relative set transaction database.
基于相关集合事务数据库这一挖掘思想，提出一个新的方法——寻找最大频繁集。
The algorithm only need scan the transaction database once, and all the transaction operations are carried out on the inverted file mapped from transaction database.
算法只需对事务数据库做一次扫描，并且所有对事务的处理操作都在事务数据库映射成的倒排文件中进行。
The algorithm only need scan the transaction database once, and all the transaction operations are carried out on the inverted file mapped from transaction database.
算法只需对事务数据库做一次扫描，并且所有对事务的处理操作都在事务数据库映射成的倒排文件中进行。
应用推荐