IS-THE graphs usage to analyze hierarchical data structures

The article defines the general principles for representing hierarchical structures, such as specializations and categorizations in data models, and class hierarchies in OOP. This representation allows a deeper analysis of the semantics of the subject area and solving the problem of optimal universa...

Full description

Saved in:
Bibliographic Details
Published inVestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika no. 66; pp. 87 - 96
Main Authors Babanov, Alexey M., Kvach, Elena S.
Format Journal Article
LanguageEnglish
Russian
Published 01.03.2024
Online AccessGet full text

Cover

More Information
Summary:The article defines the general principles for representing hierarchical structures, such as specializations and categorizations in data models, and class hierarchies in OOP. This representation allows a deeper analysis of the semantics of the subject area and solving the problem of optimal universal implementation of these structures in database systems and object-oriented applications. The possibility for such a generalization is provided by IS-THE relations and IS-THE mappings, on the basis of which IS-THE graphs are constructed. The selection of subgraphs of these graphs according to certain rules generates types of hierarchical structures known in computer science: a single inheritance hierarchy (a specialization hierarchy), a selective inheritance graph (a two-level categorization graph), a two-level multiple inheritance graph.
ISSN:1998-8605
2311-2085
DOI:10.17223/19988605/66/9