Abstract

In general, although most data existing in the WWW are modeled as some type of relational database, characteristically even information in the same domain is often structured in different ways depending on the individual manager. In order to materialize a semantic web, a method to efficiently map these different kinds of data is needed. This paper presents an algorithm for the matching between a relational database and domain ontology. Existing studies on the matching between a relational database and domain ontology were performed by extracting local ontology from a relational database. However the problem of losing domain information remains as a correlation with domain ontology is not used in the process of extracting local ontology. As a solution to this problem, we attempted to prevent the information loss through the measurement of similarity between the instances of the relational database and domain ontology, and increased the efficiency of the matching process by using information on the relation between tables in the relational database and also the relation between classes in ontology.

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 call

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.