GENERATING LINKED DATA REPOSITORIES USING UML CLASS MODEL
Download
Author:
AQSA KHAN
Citable URI :
https://vspace.vu.edu.pk/detail.aspx?id=296
Publisher :
Virtual University
Date Issued:
1/13/2020 12:00:00 AM
Abstract
We encounter difficulty in accessing and searching within bigger repositories of models and diagrams of any software schema, because of increasing usability of models and diagrams now days. The research presented in this thesis will be useful to access and search the models and diagrams in larger repositories. This investigation will be helpful in development of linked data repository which contains artifacts of UML (Unified Modeling Language), these artifacts will be utilize UML class model. Specifically, UML comprehensively applied in many data modeling domains, and developing linked data repositories by utilizing class model of UML is a strenuous job with regards of semantic web. We initiate a methodology, which constructs a tool by combining the features of UML and RDF (Resource Description Framework). Initially, linked data repositories, design artifacts, RDF and UML are formally explained. After this we will specify extraction tool of UML artifacts, these artifacts will be changed into corresponding RDFs. This process will generate linked data of RDF which will be verified by utilizing RDF W3C, it is a validating service utilized for the purpose of verification and generating the RDF graphs and triples. At the end, few experiments will be done with the designed construction tool and research will be validated. This formulation designed phenomena that will help in customization of repositories of linked data, so that models and diagrams can be retrieved in bigger data.
URI :
https://vspace.vu.edu.pk/details.aspx?id=296
Citation:
Khan, A(2019). GENERATING LINKED DATA REPOSITORIES USING UML CLASS MODEL. Virtual University of Pakistan.(Lahore, Pakistan).
Version :
Final Version
Terms of Use :
Detailed Terms :
Journal :
Files in this item |
Name |
Size |
Format |
Spring 2019_CS720_MS160400333.pdf |
1253kb |
pdf |