• Journal of the Korea Society of Computer and Information
• /
• v.23 no.10
• /
• pp.33-43
• /
• 2018

In this paper, we propose a method to automatically generate the description of an RDF graph structure. The description is expressed in Shape Expression Language (ShEx), which is developed by W3C and provides the syntax for describing the structure of RDF data. The RDF graphs to which this method can be applied are limited to those generated by the direct mapping, which is an algorithm for transforming relational data into RDF by W3C. A relational database consists of its schema including integrity constraints and its instance data. While the instance data can have been published in RDF by some standard methods such as the direct mapping, the translation of the schema has been missing so far. Unlike the users on relational databases, the ones on RDF datasets were forced to write repeated vague SPARQL queries over the datasets to acquire the exact results. This is because the schema for RDF data has not been provided to the users. The ShEx documents generated by our method can be referred as the schema on writing SPARQL queries. They also can validate data on RDF graph update operations with ShEx validators. In other words, they can work as the integrity constraints in relational databases.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.197-202
• /
• 2010

Recent studies on change detection for RDF data are focused on not only the structural difference but also the semantic-aware difference by computing the closure of RDF models. However, since these techniques which take into account the semantics of RDF model require both RDF models to be memory resident, or they use a forward-chaining strategy which computes the entire closure in advance, it is not efficient to apply them directly to detect changes in large RDF data. In this paper, we propose a scalable change detection technique for RDF data, which uses a backward-chaining inference based on relational database. Proposed method uses a new approach for RDF reasoning that computes only the relevant part of the closure for change detection in a relational database. We show that our method clearly outperforms the previous works through experiment using the real RDF from the bioinformatics domain.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.31 no.1
• /
• pp.379-392
• /
• 2020

The purpose of this study is to present technical elements to improve the data utilization of the ISNI Korea Consortium, which is operated by the National Library of Korea, which is responsible for the registration of Korean names. The ISNI Korea Consortium aims to register various creation-related information in addition to bibliographic-related individual and organization name information. To this end, this study examines the ISNI Korea consortium, which is a data provider's consultative body, among other things, the metadata status of copyright organizations and the linked data specification of ISNI. As a result, data acquisition, refining, storage, identifier management, consortium metadata management, five in total, and RDF data management (repository) in terms of linked data, RDF data issuance, RDF data retrieval, RDF data inquiry, RDF data Eight technical elements, including download, ontology inquiry, standard term inquiry and mapping information management, were derived.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.503-505
• /
• 2014

지능형 웹의 확장을 위해 링크드 데이터(Linked Open Data)를 통한 표준화 연구가 활발하게 진행되고 있다. 뿐만 아니라 링크드 데이터는 RDF, SPARQL을 이용한 정보를 더욱 더 지능적이고 다양한 분야에 적용 할 수 있는 방법으로 제시되고 있다. 하지만 이기종 환경에서는 각각 서로 다른 데이터 형식을 지니게 되므로 통합환경을 구축하는데 어려움이 따른다. 이를 위해 본 논문에서는 다양한 이기종 환경에서의 데이터 형식 변환이 가능한 RDF 컨버터를 제안한다. 제안하는 RDF 컨버터는 SPARQL를 비롯한 다양한 질의어로 데이터의 효율적인 분석, 변환이 가능하다. 성능평가를 통해 RDB 데이터 형식 분석과 RDF 데이터 변환에 대한 정확도를 확인하였고 D2RQ와 Jena2의 비교를 통해 서로 다른 RDB 데이터가 D2RQ에서 변환시간이 4.2% 빠르다는 성능을 증명하였다.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.285-293
• /
• 2008

In Semantic Web, metadata and ontology for representing semantics and conceptual relationships of information resources are essential factors. RDF and RDF Schema are W3C standard models for describing metadata and ontology. Therefore, many studies to store and retrieve RDF and RDF Schema documents are required. In this paper, we focus on some results of analyzing available query patterns considering both RDF and RDF Schema and classify queries on RDF and RDF Schema into the three patterns. RDF and RDF Schema can be represented as graph models. So, we proposed some strategies to store and retrieve using the graph models of RDF and RDF Schema. We can retrieve entities that can be arrived from a certain class or property in RDF and RDF Schema without a loss of performance on account of multiple joins with tables.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.830-832
• /
• 2000

XML형식으로 표현된 RDF data를 VRML을 사용하여 시각적으로 나타내는 방법을 연구하였다. 현재 Web 환경은 동적으로 문서를 생성하고 Visual하게 표현하는 방향으로 발전하고 있으며 이러한 환경에서 XML은 실시간으로 data를 생성하기 쉬워 많이 사용되고 있다. 그러나 XML은 text 기반이기 때문에 data를 가시화하여 사용자한테 보여주기 힘들며 data를 표현하는데 너무 많은 융통성을 제공하고 있다는 단점이 있다. 이에 XML 표현에 제약을 둬 표준적인 방식으로 표현하도록 해주는 RDF가 유용하다고 할 수 있다. 본 논문에서는 VRML을 RDF와 결합하여 실시간으로 변하는 data를 시각화 도구를 사용하여 표현하는 방법에 대해 연구를 하였다 이를 위하여 Java Servlet을 사용하였으며 RDF 문서에서 data를 추출하여 VRML 펀드를 만들고. 그 코드를 사용자측에 전달하여 시각적으로 data를 볼 수 있도록 하는 시스템을 구현하였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.10
• /
• pp.107-116
• /
• 2012

The applying of semantic technologies that aim to let computers understand and automatically process the meaning of the interlinked data on the Web is spreading. In Semantic Web, understanding and accessing the associations between data that is, the meaning between data as well as accessing to the data itself is important. W3C recommended RDF (Resource Description Framework) as a standard format to represent both Semantic Web data and their associations and also proposed several RDF query languages in order to support query processing for RDF data. However further researches on the query language definition considering the semantic associations and query processing techniques are still required. In this paper, using the suffix array-based indexing scheme previously introduced for RDF query processing, we propose a query processing approach to handle ${\rho}$-path query which is the representative type of semantic associations. To evaluate the query processing performance of the proposed approach, we implemented two different types of query processing approaches and measured the average query processing times. The experiments show that the proposed approach achieved 1.8 to 2.5 and 3.8 to 11 times better performance respectively than others two.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.623-625
• /
• 2003

The Semantic Web stands out in the next generation web, recently. In the Semantic Web, any information resources is defined by semantics and semantic links is given among these. It is different from existing web service environment. RDF (Resource Description Framework) is the data model to describe metadata of web resource and is to support for semantic links. And it is much the same as WSDL (Web Serice Description Language). In theis paper, we propose the RDF design method to improve the search performance by integrating RDF data unit with WSDL. We confirm the performance and efficiency of search will be improved by using the proposed method.

• Journal of the Korean Society for information Management
• /
• v.20 no.3
• /
• pp.241-259
• /
• 2003

The Basic Semantic Register(BSR) is and official ISO register designed for interoperability among eBusiness and EDI systems. The entities registered in the current BSR are not defined in a machine-understandable way, which renders automatic extraction of structural and relationship information from the register impossible. The purpose of this study is to offer a framework for designing an ontology that can provide semantic interoperability among BSR-based systems by defining data structures and relationships with RDF and OWL, similar meaning by the 'equivalentClass' construct in OWL, the hierachical relationships among classes by the 'subClassOf' construct in RDF schema, definition of any entities in BSR by the 'label' construct in RDF schema, specification of usage guidelines by the 'comment' construct in RDF schema, assignment of classes to BSU's by the 'domain' construct in RDF schema, specification of data types of BSU's by the 'range' construct in RDF schema. Hierarchical relationships among properties in BSR can be expressed using the 'subPropertyOf' in RDF schema. Progress in semantic interoperability can be expected among BSR-based systems through applications of semantic web technology suggested in this study.