QUALITY OF DATA MODEL SCHEMES. PRINCIPLE OF DATA MODEL COMPACTNESS AND HIS APPLICATIONS. I
A great number of contradictory and additional demands are imposed to database diagrams. At the same time the achieving of full compactness of data model structures is considered to be the fundamental claim as it moulds the frame of all data model construction that is designed or modernized. The problem of compactness is the problem of alternative multi variation of synthesized scheme. In this article the specific entity categories are introduced. These categories are the main sources of compactness problem. On the base of preliminary unified and knowingly effective structural fragments the methods and algorithms for the synthesis of absolutely compact schemes are designed.
Keywords: data model compactness, complex entity cluster, data model, data model categories, key attributes, integrity constrain, generalization abstraction, structured core of the cluster.
