Association Rules In Relational Database Mining Algorithm

With growth of database technology, popularity of network technology and updating of computer hardware, the capability of collecting data was improved rapidly. Hence, the capacity of storing data was enlarged hugely all over the world. To improve the understanding of vast data, data mining technology has improved rapidly.Association rules mining is one of important matters of data mining, which is advanced by Agrawal and the other in 1993. First the purpose is analyzing the relation of items in transaction database. Later, because investigator improved and extended the prototype of question. At present, association rules technology has been applied to business, telecommunication, finance, agriculture, medical treatment and so on. It has brought an good effect.Relational database is an important form to store lots of information of production, management and scientific research. The increase of data quantum is very fast. Studying the efficient technology of mining association rules has a wide development in future.Association rules covered by relational database is of multi-dimension, multi-value and multi-concept hierarchy of properties, which is more complicated than Boolean association rules in transaction database. This paper analyzing rules in algorithm of typical Boolean association rules in transaction database. It is conclusion that the mining algorithm of the association rules in relational database. It is core of the algorithm that relational database is operated with the gather selection and link sentence in SQL language, in order to complete the selecting course of frequent predicate set and efficient rules. Because it is efficient that relational database is operated with the SQL language, and algorithm combines the database management system closely, the algorithm is of the mining efficiency.The mining rules on the basis of constraint, on one hand, may enforce dominant action of users in order to define the mining, on other hand may reduce the selecting times of algorithm to upgrade the mining efficiency. This paper improves and simplys the mining rules of relational rules without constraint, and put forward the mining algorithm with rule constraint so as to support rapid selecting, rerifying and so on.Relying on aforesaid research, the paper introduces a kind of designing and realizing way of mining tools prototype. Considering the value of properties in relational database is usually of the concept hierarchy in fact, it is added the static disposal plan of concept hierarchy while designing mining tools. In order that users do association rules mining in diferent concept hierarchy of properties.