Inner Specialization and Generalization in Semantic Specialization and Generalization

The semantic generalization and the semantic specialization have been proposed. These enable a shape graph, which corresponds to a relation schema in the relational data model, to have elements which are different from those of the original shape graphs, but are semantically related to them. To this end, viewpoints and relationship lattices have been introduced as the hierarchies of concepts and relationships. The semantically generalized (specialized, respectively) element is a common ancestor (descendant) of the original ones in a viewpoint or relationship lattice. Semantically generalized and specialized elements are specified by users. As they are explicitly specified, those from the elements of a shape graph could also be created. This kind of generalization (specialization, respectively) is called the inner generalization (specialization). This paper discusses the inner generalization and the inner specialization. Their merits are shown by using examples.