THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅱ）: THE DECOMPO SITION ALGORITHM AND ITS ANALYSIS

HAO Zhongxiao; YU Meisheng; ZHANG Xiaodong

HAO Zhongxiao, YU Meisheng, ZHANG Xiaodong. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅱ）: THE DECOMPO SITION ALGORITHM AND ITS ANALYSISJ. Journal of Computer Research and Development, 1998, 35(4).

Citation:

HAO Zhongxiao, YU Meisheng, ZHANG Xiaodong. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅱ）: THE DECOMPO SITION ALGORITHM AND ITS ANALYSISJ. Journal of Computer Research and Development, 1998, 35(4).

Citation:

HAO Zhongxiao, YU Meisheng, ZHANG Xiaodong. THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅱ）: THE DECOMPO SITION ALGORITHM AND ITS ANALYSISJ. 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 DECOMPO SITION ALGORITHM AND ITS ANALYSIS

Graphical Abstract

Abstract

Abstract

A decomposition algorithm and its correctness proof and analysis are given based on ,, and ,when a database schema without inside conflict and α cycle meets P 3 .

FullText(HTML)

References (0)

THE DECOMPOSITION OF A DATABASE SCHEMA WITHOUT INSIDE CONFLICT AND α CYCLE AND MEETING P 3 （Ⅱ）: THE DECOMPO SITION ALGORITHM AND ITS ANALYSIS

Abstract

Catalog

Export File

Citation

Format

Content