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 3NF 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.
Data organization Decomposition algorithm Acyclic Simple normal form
LING-QIANG ZHAO ZHAO-PENG GU ZHONG-XIAO HAO
College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 1500 College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 1500
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
781-788
2007-08-19（万方平台首次上网日期，不代表论文的发表时间）