Researches On Data Records Match And Consistent Base On Tableau

Data quality has been recognized as one of the most important issue of data management. In the light of the problem of mismatch and inconsistent data records, from the record matching detection and inconsistent repair of two points of view, proposed record matching method based on the CON model and automatically detect and repair database based on tableau. Meanwhile, on the basis of the proposed theory, put eclipse as the experimental development platform, applied the above algorithms to the experiments. The experimental results show that these methods for the verification records to match and repair inconsistent database is correct and effective.The main research results are concluded as follows:â…°. Based on local CON model, a record matching method is proposed. It uses algorithm of association rules to get the match dependence, take the match dependence and data instances as the input at the same time, at last it can get the result by match detection. Experimental comparison and theoretical analysis show that the method can quickly identify whether the distributed records match, and it does not require human intervention, much better than previous methods.â…±. Put the inconsistent as the CFDs violating conditions, an automatic detection and repair inconsistent database BCFDAR algorithm is proposed, and theoretically proved that the algorithm can be terminated normally. The experimental results show that this method can effectively repair inconsistent database, and CFDs reflect the higher accuracy than the traditional FDs, and add to the optimization algorithm, making the detection and repair process more efficient.â…². Based on the tableau method extending to inconsistent database repairs, a new method of repairing the database that use the value of branch closure is proposed. This method combines the analysis of tableau open and closed reasoning criterion, bases on opening formula tree TP(ICur), and imports every node a closed value of the TP(IC u r). According to the definition of node closed value, which can select branches repair by computing node closed value and directly determine the database instances which need repair. This method also considers repair with I closure and extends opening branches to repair, and gives the logical proof. At last, the logical characteristics of consistent query answer are proved.