Methods for Key-Based Conflicts of Data Organization in Information Integrated Systems

The implement of large relational database platform becomes the foundation of data organization in MIS, MRPII, ERP, and etc. It influences the efficiency and even success to the development of the whole system. Query-response time and its correctness seems to be the most important measurement of database performance comparing to other facts such as use of the peripheral equipment and memory requirement. Hence query optimization is very important. The general method is to standardize the relations into normal form, such as 3 NF or BCNF. But the performance is not good. The acyclic database that combines the graph theory has several good properties especially on query optimization and correctness of query results. In this paper, data confliction in functional dependency environment was discussed. Beside, a decomposition algorithm was proposed to standardize a relation into a schema meeting SNF and a-acyclic with proof and analysis.