• IE interfaces
• /
• v.21 no.2
• /
• pp.177-188
• /
• 2008

Recently, due to emerging technologies such as radio frequency identification(RFID), global positioning system(GPS), and wireless mobile communication technologies, it is possible to build up the infrastructure for tracking and tracing product logistics data at any place and at any time. However, for implementing the infrastructure, it is necessary to develop a suitable management method for product logistics data. To this end, this study deals with a resource description framework(RDF) based modeling and application method for product logistics data in the ubiquitous environment. It will give us the capability to control product logistics data, which leads to streamline logistics operations.

• Korean Journal of Computational Design and Engineering
• /
• v.10 no.2
• /
• pp.97-106
• /
• 2005

W3C has developed the RDF standard for utilizing ontology in Web applications. This paper presents extracting, storing, and applying ontology on product data. The design and tooling information included in STEP-NC files is focused as an example. By analyzing the relationship among the product data, the RDF schema is designed first. Based on the schema ontology if extracted and stored in XML files. As an application of the stored ontology, we can reconfigure the sitemap of product data repositories. In this example, the users can select the view that he or she is interested in (e.g. product, tool, person). With such various views of an product data repository, the users can access the specific data more effectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.142-144
• /
• 2011

In a world in constant changes, more and more devices are producing data and it is indispensable to manage these data. That is why map reduce framework is a solution to manage a large amount of data in a fast and right way. In the other hand semantic web (RDF/OWL) is getting popular and can be a solution to manage data in an efficient way, so that such data can be retrieved and understood by both human and machine. In this paper we describes and analyze some projects that manages RDF with Map-Reduce framework.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.155-168
• /
• 2008

This paper proposes a relational security model-based RDF Web ontology access control model. The Semantic Web is recognized as a next generation Web and RDF is a Web ontology description language to realize the Semantic Web. Much effort has been on the RDF and most research has been focused on the editor, storage, and inference engine. However, little attention has been given to the security issue, which is one of the most important requirements for information systems. Even though several researches on the RDF ontology security have been proposed, they have overhead to load all relevant data to memory and neglect the situation that most ontology storages are being developed based on relational database. This paper proposes a novel RDF Web ontology security model based on relational database to resolve the issues. The proposed security model provides high practicality and usability, and also we can easily make it stable owing to the stability of the relational database security model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.223-225
• /
• 2005

시맨틱 웹의 구현을 위한 수단으로 RDF 및 기타 기반 기술이 사용되고 있다. 이에 따라, 방대한 RDF 데이터의 효율적인 관리를 위한 연구들이 최근 활발하게 국내외에서 진행 중이다. 기존의 많은 연구들은 관계형 데이터베이스 시스템을 이용하여 트리플 형태의 RDF 데이터의 저장하는 방법을 제안하였다. 이러한 방법은 하나의 대규모 테이블상에 RDF 데이터를 저장하므로 데이터 관리측면에서 장점이 있으나 질의 처리 측면에서 볼 때 항상 테이블 전체를 접근해야 하므로 검색 성능이 저하될 수 있는 문제점이 있다. 본 논문에서는 질의 처리 성능을 높이기 위해 프로퍼티를 기반으로 RDF 데이터를 절러 개의 테이블로 분할 저장하는 기법을 제안한다.

• 연구논문집
• /
• s.31
• /
• pp.45-51
• /
• 2001

One of emerging technologies under development in the advanced countries is considered as RDF(Refuse Derived Fuel) power generation, which could meet both the requirement of an alternative energy resource utilization and $CO_2$ reduction. This paper deals with the effect to the thermal effiency and CO2 reduction of RDF firing power generation. The statistical data of domestic MSW generation in last year in small and medium cities for evaluating the merits of the RDF power generation were used. The analysis for RDF power generation compared to the existing incinerator w/o(or w/) power generation shows around 20.6%(10.0%) up in the total thermal efficiency and 57.0%(31.4%) up in the $CO_2$ reduction respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.10
• /
• pp.23-34
• /
• 2020

In this paper, we proposes a method to automatically construct SHACL schemas for RDF knowledge graphs(KGs) generated by Direct Mapping(DM). DM and SHACL are all W3C recommendations. DM consists of rules to transform the data in an RDB into an RDF graph. SHACL is a language to describe and validate the structure of RDF graphs. The proposed method automatically translates the integrity constraints as well as the structure information in an RDB schema into SHACL. Thus, our SHACL schemas are able to check integrity instead of RDBMSs. This is a consideration to assure database consistency even when RDBs are served as virtual RDF KGs. We tested our results on 24 DM test cases, published by W3C. It was shown that they are effective in describing and validating RDF KGs.

• KIISE Transactions on Computing Practices
• /
• v.23 no.5
• /
• pp.275-283
• /
• 2017

A large amount of RDF data has been generated along with the increase of semantic web services. Various distributed storage and query processing schemes have been studied to efficiently use the massive amounts of RDF data. In this paper, we propose a distributed SPARQL query processing scheme that considers the data locality and query execution path of large RDF data. The proposed scheme considers the data locality and query execution path in order to reduce join and communication costs. In a distributed environment, when processing a SPARQL query, it is divided into several sub-queries according to the conditions of the WHERE clause by considering the data locality. The proposed scheme reduces data communication costs by grouping and processing the sub-queries through the index based on associated nodes. In addition, in order to reduce unnecessary joins and latency when processing the query, it creates an efficient query execution path considering data parsing cost, the amount of each node's data communication, and latency. It is shown through various performance evaluations that the proposed scheme outperforms the existing scheme.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.151-162
• /
• 2006

RDF Semantics, one of W3C Recommendations, provides the RDFS entailment rules, which are used for the RDFS inference. Sesame, which is well known RDF repository, supports the RDBMS-based RDFS inference using the forward-chaining strategy. Since inferencing in the forward-chaining strategy is performed in the data loading time, the data loading time in Sesame is slow down be inferencing. In this paper, we propose the order scheme for applying the RDFS entailment rules to improve inference performance. The proposed application order makes the inference process terminate without repetition of the process for most cases and guarantees the completeness of inference result. Also the application order helps to reduce redundant results during the inference by predicting the results which were made already by previously applied rules. In this paper, we show that our approaches can improve the inference performance with comparisons to the original Sesame using several real-life RDF datasets.

• The Journal of the Korea Contents Association
• /
• v.15 no.1
• /
• pp.9-23
• /
• 2015

In this paper, we propose a new RDF index scheme considering the characteristics of large scale RDF data to improve the query processing performance. The proposed index scheme creates a S-O index for subjects and objects since the subjects and objects of RDF triples are used redundantly. In order to reduce the total size of the index, it constructs a P index for the relatively small number of predicates in RDF triples separately. If a query contains the predicate, we first searches the P index since its size is relatively smaller compared to the S-O index. Otherwise, we first searches the S-O index. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the query processing time.