Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
