HAO Zhongxiao. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅰ）: THE BASIC THEORY OF DECOMPOSITIONJ. Journal of Computer Research and Development, 1998, 35(4).
Citation:
HAO Zhongxiao. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅰ）: THE BASIC THEORY OF DECOMPOSITIONJ. Journal of Computer Research and Development, 1998, 35(4).
HAO Zhongxiao. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅰ）: THE BASIC THEORY OF DECOMPOSITIONJ. Journal of Computer Research and Development, 1998, 35(4).
Citation:
HAO Zhongxiao. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅰ）: THE BASIC THEORY OF DECOMPOSITIONJ. Journal of Computer Research and Development, 1998, 35(4).
THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅰ）: THE BASIC THEORY OF DECOMPOSITION
The properties and theory of decomposition are discussed based on , and when the minimum merge dependency set D of a database schema without inside conflict has the conflict of weak left side or right side.And a basis is founded for the decomposition algorithm design of a database schema without inside conflict and α cycle and meeting P 3 .
DownLoad: