The RDFS mapping for recursive relationship of relational data model

Mi Young Choi, Chang Joo Moon, Doo Kwon Baik, Young Jun Wie, Joong Hee Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

The growing demand for a Semantic Web is focusing attention on Semantic Web trials that use a huge amount of data from a relational database (RDB). Hence, the literature on the transformation of RDB data to resource description framework (RDF) statements has consequently become very important. The relational data model (RDM), the base of RDB, represents real world data using relationships [1]. In existing research, the mapping of RDB data to RDF only generates an RDF triple statement from an RDB table structure in a flat level; existing research does not consider the mapping of RDM which describes the business rules. In RDM, the relationship describes real world business rules by connecting the two entities. If one entity relates to itself, then it has a recursive relationship which helps to explain the logical data model and extend its flexibility. The recursive relationship is a necessary relation type of most data models to describe more complex business rules. This paper suggests a mapping method to map the two types of recursive relationships to the resource description framework schema (RDFS). One type of recursive relationship is generated during the integration process with different entities at different levels in a hierarchical structure while the other is generated at the hierarchical structure between the instances of an attribute in an entity. The transformed RDFS, including the class, subclasses, and subproperties minimizes the loss of data meaning and enables the process of the inference function to be used with RDB data. The method of transforming RDB data to inferable, transitive RDF/RDFS with SQL implies that the most difficult step of writing a Semantic Web can be automated. In short, the proposed method enables a Semantic Web to be built with greater efficiency.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010
DOIs
Publication statusPublished - 2010 Dec 1
Event2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010 - Perth, WA, Australia
Duration: 2010 Dec 132010 Dec 15

Other

Other2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010
CountryAustralia
CityPerth, WA
Period10/12/1310/12/15

Fingerprint

Data structures
Semantic Web
Industry

Keywords

  • RDF/RDFS
  • Recursive relationship
  • Relational data model
  • Relational database
  • Semantic web

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Choi, M. Y., Moon, C. J., Baik, D. K., Wie, Y. J., & Park, J. H. (2010). The RDFS mapping for recursive relationship of relational data model. In Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010 [5707157] https://doi.org/10.1109/SOCA.2010.5707157

The RDFS mapping for recursive relationship of relational data model. / Choi, Mi Young; Moon, Chang Joo; Baik, Doo Kwon; Wie, Young Jun; Park, Joong Hee.

Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010. 2010. 5707157.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, MY, Moon, CJ, Baik, DK, Wie, YJ & Park, JH 2010, The RDFS mapping for recursive relationship of relational data model. in Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010., 5707157, 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010, Perth, WA, Australia, 10/12/13. https://doi.org/10.1109/SOCA.2010.5707157
Choi MY, Moon CJ, Baik DK, Wie YJ, Park JH. The RDFS mapping for recursive relationship of relational data model. In Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010. 2010. 5707157 https://doi.org/10.1109/SOCA.2010.5707157
Choi, Mi Young ; Moon, Chang Joo ; Baik, Doo Kwon ; Wie, Young Jun ; Park, Joong Hee. / The RDFS mapping for recursive relationship of relational data model. Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010. 2010.
@inproceedings{52076b69b6bd4f729e64041f250d5410,
title = "The RDFS mapping for recursive relationship of relational data model",
abstract = "The growing demand for a Semantic Web is focusing attention on Semantic Web trials that use a huge amount of data from a relational database (RDB). Hence, the literature on the transformation of RDB data to resource description framework (RDF) statements has consequently become very important. The relational data model (RDM), the base of RDB, represents real world data using relationships [1]. In existing research, the mapping of RDB data to RDF only generates an RDF triple statement from an RDB table structure in a flat level; existing research does not consider the mapping of RDM which describes the business rules. In RDM, the relationship describes real world business rules by connecting the two entities. If one entity relates to itself, then it has a recursive relationship which helps to explain the logical data model and extend its flexibility. The recursive relationship is a necessary relation type of most data models to describe more complex business rules. This paper suggests a mapping method to map the two types of recursive relationships to the resource description framework schema (RDFS). One type of recursive relationship is generated during the integration process with different entities at different levels in a hierarchical structure while the other is generated at the hierarchical structure between the instances of an attribute in an entity. The transformed RDFS, including the class, subclasses, and subproperties minimizes the loss of data meaning and enables the process of the inference function to be used with RDB data. The method of transforming RDB data to inferable, transitive RDF/RDFS with SQL implies that the most difficult step of writing a Semantic Web can be automated. In short, the proposed method enables a Semantic Web to be built with greater efficiency.",
keywords = "RDF/RDFS, Recursive relationship, Relational data model, Relational database, Semantic web",
author = "Choi, {Mi Young} and Moon, {Chang Joo} and Baik, {Doo Kwon} and Wie, {Young Jun} and Park, {Joong Hee}",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/SOCA.2010.5707157",
language = "English",
isbn = "9781424498017",
booktitle = "Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010",

}

TY - GEN

T1 - The RDFS mapping for recursive relationship of relational data model

AU - Choi, Mi Young

AU - Moon, Chang Joo

AU - Baik, Doo Kwon

AU - Wie, Young Jun

AU - Park, Joong Hee

PY - 2010/12/1

Y1 - 2010/12/1

N2 - The growing demand for a Semantic Web is focusing attention on Semantic Web trials that use a huge amount of data from a relational database (RDB). Hence, the literature on the transformation of RDB data to resource description framework (RDF) statements has consequently become very important. The relational data model (RDM), the base of RDB, represents real world data using relationships [1]. In existing research, the mapping of RDB data to RDF only generates an RDF triple statement from an RDB table structure in a flat level; existing research does not consider the mapping of RDM which describes the business rules. In RDM, the relationship describes real world business rules by connecting the two entities. If one entity relates to itself, then it has a recursive relationship which helps to explain the logical data model and extend its flexibility. The recursive relationship is a necessary relation type of most data models to describe more complex business rules. This paper suggests a mapping method to map the two types of recursive relationships to the resource description framework schema (RDFS). One type of recursive relationship is generated during the integration process with different entities at different levels in a hierarchical structure while the other is generated at the hierarchical structure between the instances of an attribute in an entity. The transformed RDFS, including the class, subclasses, and subproperties minimizes the loss of data meaning and enables the process of the inference function to be used with RDB data. The method of transforming RDB data to inferable, transitive RDF/RDFS with SQL implies that the most difficult step of writing a Semantic Web can be automated. In short, the proposed method enables a Semantic Web to be built with greater efficiency.

AB - The growing demand for a Semantic Web is focusing attention on Semantic Web trials that use a huge amount of data from a relational database (RDB). Hence, the literature on the transformation of RDB data to resource description framework (RDF) statements has consequently become very important. The relational data model (RDM), the base of RDB, represents real world data using relationships [1]. In existing research, the mapping of RDB data to RDF only generates an RDF triple statement from an RDB table structure in a flat level; existing research does not consider the mapping of RDM which describes the business rules. In RDM, the relationship describes real world business rules by connecting the two entities. If one entity relates to itself, then it has a recursive relationship which helps to explain the logical data model and extend its flexibility. The recursive relationship is a necessary relation type of most data models to describe more complex business rules. This paper suggests a mapping method to map the two types of recursive relationships to the resource description framework schema (RDFS). One type of recursive relationship is generated during the integration process with different entities at different levels in a hierarchical structure while the other is generated at the hierarchical structure between the instances of an attribute in an entity. The transformed RDFS, including the class, subclasses, and subproperties minimizes the loss of data meaning and enables the process of the inference function to be used with RDB data. The method of transforming RDB data to inferable, transitive RDF/RDFS with SQL implies that the most difficult step of writing a Semantic Web can be automated. In short, the proposed method enables a Semantic Web to be built with greater efficiency.

KW - RDF/RDFS

KW - Recursive relationship

KW - Relational data model

KW - Relational database

KW - Semantic web

UR - http://www.scopus.com/inward/record.url?scp=79952523283&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952523283&partnerID=8YFLogxK

U2 - 10.1109/SOCA.2010.5707157

DO - 10.1109/SOCA.2010.5707157

M3 - Conference contribution

SN - 9781424498017

BT - Proceedings - 2010 IEEE International Conference on Service-Oriented Computing and Applications, SOCA 2010

ER -