Integration of the family of extended description logic languages with relational data model

2016 ◽  
pp. 032-037
Author(s):  
V.A. Reznichenko ◽  
◽  
I.S. Chystiakova ◽  
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Description Logic ◽  
Relational Data ◽  
Data Manipulation ◽  
Relational Data Model ◽  
The Family ◽  
The Creation

The paper is a logical continuation of the previously published work, which was dedicated to the creation of the data manipulation methods. Based on the previously created binary relational data structure we perform mappings of the ALC extension into relational data model (RDM). The results of previous research namely data structure RM2 and mappings of the basic ALC concepts into RDM was used in this paper.

Integration of the description logics with operations at role constructors into relational data model

2016 ◽  
pp. 058-065
Author(s):  
I.S. Chystiakova ◽  
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Description Logic ◽  
Description Logics ◽  
Relational Data ◽  
Relational Data Model ◽  
Model Based ◽  
The Creation

The paper is a logical continuation of the previously published work, which was dedicated to the creation of mappings from the description logic into binary relational data model. Based on the previously created binary relational data structure we perform mappings of the ALC extension into relational data model (RDM). The results of previous research namely data structure RM2, mappings of the basic ALC concepts and its classical extensions into RDM were used in this paper.

Integration of the description logics axiomatic into relational data model

2017 ◽  
pp. 051-058
Author(s):  
I.S. Chystiakova ◽  
Keyword(s):  
Data Structure ◽  
Data Model ◽  
Description Logic ◽  
Description Logics ◽  
Relational Data ◽  
Relational Data Model ◽  
The Creation

The paper is a logical continuation of the previously published work, which was dedicated to the creation of mappings from the description logic into binary relational data model. On base of the previously created binary relational data structure we perform mappings of the ALC axiomatic into relational data model (RDM). The results of previous research namely data structure RM2, mappings of the basic ALC concepts were used in this paper.

scholarly journals On the equivalent descriptions of family of functional dependencies in the relational data model

2016 ◽  
Vol 11 (4) ◽  
pp. 35-45
Author(s):  
Vũ Đức Thi
Keyword(s):  
Data Model ◽  
Functional Dependency ◽  
Relational Data ◽  
Functional Dependencies ◽  
Relational Data Model ◽  
Design And Implementation ◽  
Closure Operations ◽  
The Family ◽  
Equivalent Description

The family of functional dependencies (FDs) was introduced by E.F. Codd. Equivalent descriptions of family of FDs play essential rules in the design and implementation of the relation datamodel. It is known [1,3,4,5,7,8,12,13,15] that closure operations, meet-semilattices, families of members which are not intersections of two other members give the equivalent descriptions of family of FDs. i.e. they and family of  FDs determine each other uniquely. These equivalent description were  successfully applied to find many desirable properties of  functional dependency. This paper introduces the concept of maximal family of attributes. We prove that this family is an equivalent description of family of FDs. The concept of nonredundant family of attributes is also introduced in this paper. We present some characterizations and desirable properties of these families.

scholarly journals Implementation of mappings between the description logic and the binary relational data model on the RDF level

2020 ◽  
pp. 041-054
Author(s):  
I.S. Chystiakova ◽  
Keyword(s):  
Data Model ◽  
Description Logic ◽  
Relational Data ◽  
Practical Implementation ◽  
Theoretical Level ◽  
Schematic Representation ◽  
Rdf Graph ◽  
Relational Data Model ◽  
Integration Problem ◽  
Mapping Language

This paper is dedicated to the data integration problem. In article the task of practical implementation of mappings between description logic and a binary relational data model is discussed. This method was formulated earlier at a theoretical level. A practical technique to test mapping engines using RDF is provided in the current paper. To transform the constructs of the description logic ALC and its main extensions into RDF triplets the OWL 2-to-RDF mappings are used. To convert RDB to RDF graph, the R2R Mapping Language (R2R ML) was chosen. The mappings DL ALC and its main extensions to the RDF triplets are described in the publication. The mapping of the DL axioms into an RDF triplet also is considered in the publication. The main difficulties in describing DL-to-RDF transformations are given in the corresponding section. For each constructor of concepts and roles a corresponding expression in OWL 2 and its mapping into the RDF triplet. A schematic representation of the resulting RDF graph for each mapping is created. The paper also provides an overview of existing methods that relate to the use of RDF when mapping RDB to ontology and vice versa.

Mapping of Description Logic to the Relational Data Model

2017 ◽  
Vol 53 (6) ◽  
pp. 963-977 ◽  
Author(s):  
P. I. Andon ◽  
V. A. Reznichenko ◽  
I. S. Chistyakova
Keyword(s):  
Data Model ◽  
Description Logic ◽  
Relational Data ◽  
Relational Data Model

scholarly journals Storing Hypergraph-Based Data Models in Non-hypergraph Data Storage and Applications for Information Systems

2021 ◽  
pp. 1-21
Author(s):  
Bálint Molnár ◽  
András Béleczki ◽  
Bence Sarkadi-Nagy
Keyword(s):  
Information Systems ◽  
Data Storage ◽  
Data Model ◽  
Relational Data ◽  
Complex Data ◽  
Graph Representations ◽  
Relational Data Model ◽  
Rich Information ◽  
The Relationship

Data structures and especially the relationship among the data entities have changed in the last couple of years. The network-like graph representations of data-model are becoming more and more common nowadays, since they are more suitable to depict these, than the well-established relational data-model. The graphs can describe large and complex networks — like social networks — but also capable of storing rich information about complex data. This was mostly of relational data-model trait before. This also can be achieved with the use of the knowledge representation tool called “hypergraphs”. To utilize the possibilities of this model, we need a practical way to store and process hypergraphs. In this paper, we propose a way by which we can store hypergraphs model in the SAP HANA in-memory database system which has a “Graph Core” engine besides the relational data model. Graph Core has many graph algorithms by default however it is not capable to store or to work with hypergraphs neither are any of these algorithms specifically tailored for hypergraphs either. Hence in this paper, besides the case study of the two information systems, we also propose pseudo-code level algorithms to accommodate hypergraph semantics to process our IS model.

Sign in / Sign up

Export Citation Format

Share Document