• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.422-433
• /
• 2009

As an effort to secure Semantic Web, in this paper, we introduce an RDF access authorization model based on an ontology hierarchy and an RDF triple pattern. In addition, we apply the authorization model to RDF query validation for approved access authorizations. A subscribed SPARQL or RQL query, which has RDF triple patterns, can be denied or granted according to the corresponding access authorizations which have an RDF triple pattern. In order to efficiently perform the query validation process, we first analyze some primary authorization conflict conditions under RDF subsumption inference, and then we introduce an efficient query validation algorithm using the conflict conditions and Dewey graph labeling technique. Through experiments, we also show that the proposed validation algorithm provides a reasonable validation time and when data and authorizations increase it has scalability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.208-210
• /
• 2002

웹의 이용이 보편화되면서 웹 상의 자원(Resource) 또한 급격히 증가하고 있다. 이러한 상황에서 웹 자원을 효율적으로 기술할 수 있는 RDF(Resource Description Framework)는 웹 자원을 체계적으로 관리할 수 있는 지평을 열어주었다. 그러나 현재 RDF문서의 저작환경은 저차원적인 텍스트 편집 수준으로 파싱(parsing)과 유효성 검사(validation checking)를 지원하지 못하고 있는 실정이다. 따라서 본 논문에서는 저작환경을 개선함과 동시에 RDF 및 XML 문서에 대한 파싱 및 유효성 검사를 효율적으로 수행하고, RDF로 기술된 웹 자원을 n-triple 형식으로 생성할 수 있는 RDF 저작 툴을 설계 및 구현하여 유효성이 보장된 웹 자원을 효율적으로 생성 및 처리할 수 있도록 하였다.

• The KIPS Transactions:PartB
• /
• v.11B no.5
• /
• pp.619-624
• /
• 2004

The quantity of business information like to be shared enterprise information and business catalog quickly increased because of activating e-commerce. Necessary of metadata management which is using RDF was required. RDF metadata management does not have to be restricted by RDF/RDFS knowledges, has to describe web resources and has to support metadata validation. But research which supports this is not enough. In this paper we enable to create and manage RDF/RDFS document using various interfaces, change from metadata to N-Triple and verify metadata validation.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.67-80
• /
• 2022

In this paper, we propose a system which automatically generates the ShEx schemas to describe and validate RDF knowledge graphs constructed by RML mapping. ShEx schemas consist of constraints. The proposed system generates most of the constraints by converting the RML mapping rules. The schemas consisting only of constraints obtained from mapping rules can help users to figure out the structure of the graphs generated by RML mapping, but they are not sufficient for sophisticated validation purposes. For users who need a schema for validation, the proposed system is also able to provide the schema with added constraints generated from metadata extracted from the input data sources for RML mapping. The proposed system has the ability to handle CSV, XML, JSON or RDBMS as input data sources. Testing results from 297 cases show that the proposed system can be applied for RDF graph validation in various practical cases.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.9
• /
• pp.77-89
• /
• 2022

In this paper, we propose a system which automatically generates SHACL schemas to describe and validate RDF knowledge graphs constructed by RML mappings. Unlike existing studies, the proposed system generates the schemas based on not only RML mapping rules but also metadata extracted from RML mapping input data in various formats such as CSV, JSON, XML or databases. Therefore, our schemas include the constraints on data type, string length, value range and cardinality, which were not present in the existing schemas. And we solves the problem with "repeated properties" which overlooked in existing studies. Through a conformance test consisting of 297 cases, we show that the proposed system generates correct constraints for the graphs. The proposed system can contribute to automation of the tedious and error-prone existing manual validation processes.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.8
• /
• pp.9-21
• /
• 2020

With the proliferation of RDF knowledge graphs(KGs), there arose a need of a standardized schema representation of the graph model for effective data interchangeability and interoperability. The need resulted in the development of SHACL specification to describe and validate RDF graph's structure by W3C. Relational databases(RDBs) are one of major sources for acquiring structured knowledge. The standard for automatic generation of RDF KGs from RDBs is R2RML, which is also developed by W3C. Since R2RML is designed to generate only RDF data graphs from RDBs, additional manual tasks are required to create the schemas for the graphs. In this paper we propose an approach to automatically generate SHACL schemas for RDF KGs populated by R2RML mappings. The key of our approach is that the SHACL shemas are built only from R2RML documents. We describe an implementation of our appraoch. Then, we show the validity of our approach with R2RML test cases designed by W3C.

• 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.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.447-450
• /
• 2004

인터넷의 보급으로 인해 수많은 데이터가 생성되고 있고 이러한 데이터를 효율적으로 관리하고자 메타데이타 표준이 수차례에 걸쳐 발표되었다. 그러나 기존 발표된 표준들은 데이터 관리를 위해 특정 도메인에 제한적이거나 너무 광범위하여 효율적이지 못하다는 문제를 가지고 있다. 또한 표준에 따라 생성된 메타데이타라 할지라도 유효성을 검증하지 못하기 때문에 정확한 메타데이타로 정의내릴 수 없는 실정이다. 따라서 본 논문에서는 RDF(Resource Description Framework)에 기초하여 메타데이타를 효율적으로 저작할 수 있는 저작 기능, 생성된 메타데이타에 대한 유효성 검증이 가능한 유효성 검증 기능, 메타데이타의 N-Triple 표현을 지원하고 생성할 수 있는 N-Triple Generator를 지원할 수 있는 RDF 기반 저작 틀을 개발하였다.

• Journal of the Korean Chemical Society
• /
• v.60 no.4
• /
• pp.225-234
• /
• 2016

The activity of 34 sulfonamide derivatives has been estimated by means of multiple linear regression (MLR), artificial neural network (ANN), simulated annealing (SA) and genetic algorithm (GA) techniques. These models were also utilized to select the most efficient subsets of descriptors in a cross-validation procedure for non-linear -log (IC50) prediction. The results obtained using GA-ANN were compared with MLR-MLR, MLR-ANN, SA-ANN and GA-ANN approaches. A high predictive ability was observed for the MLR-MLR, MLR-ANN, SA-ANN and MLR-GA models, with root mean sum square errors (RMSE) of 0.3958, 0.1006, 0.0359, 0.0326 and 0.0282 in gas phase and 0.2871, 0.0475, 0.0268, 0.0376 and 0.0097 in solvent, respectively (N=34). The results obtained using the GA-ANN method indicated that the activity of derivatives of sulfonamides depends on different parameters including DP03, BID, AAC, RDF035v, JGI9, TIE, R7e+, BELM6 descriptors in gas phase and Mor 32u, ESpm03d, RDF070v, ATS8m, MATS2e and R4p, L1u and R3m in solvent. In conclusion, the comparison of the quality of the ANN with different MLR models showed that ANN has a better predictive ability.

• Journal of Software Assessment and Valuation
• /
• v.13 no.1
• /
• pp.15-21
• /
• 2017

Analyzing a software package which is consisted of big numbers of files takes enormous costs and time. Therefore, SPDX (Software Package Data Exchange) working group collaborate with Linux Foundation published a software information(metadata) specification: SPDX. On the first half of 2017, the specification contains seven chapters and 66 items, according to Ver 2.1 of SPDX spec. It prefers Tag/Value or RDF forms but also supports spreadsheet form. In this paper, we introduce SPDX parsing & validation tools to check the validity of SPDX document. We'll develop SPDX document generator to manage software package more efficiently for our next target.