• Journal of Internet Computing and Services
• /
• v.8 no.2
• /
• pp.95-103
• /
• 2007

Many techniques have been proposed for mapping from XML to relations, but most techniques did not negotiate the semantics of XML data. The semantics is important to validate storage, query optimization, modification anomaly in process of schema design. Specially, functional dependencies are an important part of database theory, also it is basis of normalization for relational table in BCNF. This paper propose a new technique that reflect functional dependencies to store relation mapped from XML based on XML Schema. The technique can reduce storage redundancy and can keep up content and structure with constraint described by functional dependencies.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.415-420
• /
• 2005

Mathematical modeling and simulation of biochemical reaction networks gained a lot of attention recently since it can provide valuable insights into the interrelationships and interactions of genes, proteins and metabolites in a reaction network. A number of attempts have been made for modeling and storing biochemical reaction networks without their dynamical properties but unfortunately storing and efficiently querying of the dynamic (mathematical) models are not yet studied extensively. In this paper, we present a novel nested relational data schema to store a pathway with its dynamic properties. We then show how to make the mapping between this dynamic pathway schema with the corresponding static pathway representation.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.7
• /
• pp.1324-1330
• /
• 2011

This paper presents the development of gateway for smart grid for the interoperable communication between IEC 61850 station leveled devices and one of legacy Modbus, DNP3, and IEC60870-5-101/104/103 communication protocol devices of bay level in substation or for the exchange of information between IEC 61850 substation and SCADA control center. The data-mapping model is designed for the exchange of information and the gateway configuration tool is developed for generating meta-data based on XML Schema. this paper is mostly concerned with the design and realization of gateway system for the interoperable data communication between a legacy protocol device and IEC61850 based devices or systems.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.486-501
• /
• 2005

XPDL is a XML-based language for process definition exchange that is proposed by WfMC. This paper propose a model which model XPDL document structure (Schema) using UML in order to define and to exchange workflow process, and make business flow understanding ease for inter-business cooperation. So, we define mapping rules in which map XPDL documents into UML class diagram and UML activity diagram. By these mapping rules, elements composing XPDL process meta-model are mapped into UML class diagram, and process activities are mapped into UML activity diagram. Also, we apply proposed mapping technique to model a workflow of (')Credit card state check system.(')

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.1-9
• /
• 2009

Many techniques have been proposed to store efficiently and query XML data. One way achieving this goal is using relational database by transforming XML data into relational format. But most researches only transformed content and structure of XML schema. Although they transformed semantic constrainment of XML schema, they did not all of semantics. In this paper, we propose a systematic technique for extracting semantic constrainment from XML schema and storing method when the extracting result is transformed into relational schema without any lost of semantic constrainment. The transforming algorithm is used for extracting and storing semantic constrainment from XML schema and it shows how extracted information is stored according to schema notation. Also it provides semantic knowledges that are needed to be confirmed during the transformation to ensure a correct relation schema. The technique can reduce storage redundancy and can keep up content and structure with integrity constraints.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.289-291
• /
• 2002

본 논문에서는 객체지향 패러다임의 구조적 특성을 적용하여 만든 시소러스를 이용하여 웹 자원의 의미적 연관성을 RDF 형식으로 표현할 수 있는 RDF 문서 자동 생성기를 소개한다. 객체지향 시소러스를 RDF 형식으로 나타내기 위해 시소러스에 사용된 객체와 관계의 내용을 명세한 네임 스페이스를 정의하여 시맨틱 웹에서 메타데이타를 기술하는 표준이 되는 RDF와 RDF Schema 형식으로 매핑할 수 있다. 이러한 연구를 통해 객체지향 시소러스의 내용을 RDF 형식으로 표현함으로써 지식베이스(KnowledgeBase)라 불리는 온톨로지를 생성할 수 있으며, 구축된 온톨로지는 시맨틱 웹 상의 에이전트나 다른 어플리케이션에 응용될 수 있다.

• Journal of Information Technology Applications and Management
• /
• v.9 no.1
• /
• pp.71-84
• /
• 2002

As the application area of XML extends to the database from simple contents, the technology for the storage and management of XML also grows with the XML. One of the main issues is how to efficiently manage the XML by using the previous DBMS. Many studies have been performed for the efficient management based on the XML application and database interface. However, the XML data is based on the object and has the hierarchical structure. Accorkingly, a modeling plan needs to store the XML data on the variety type of database. In this paper, for easier connection between XML application and database system, we have designed components for the transformation from XML DTD to ORDB schema. The method of the design for the transformation from XML DTD to ORDB schema is chosen the method of CBD.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.301-302
• /
• 2023

A service platform was designed to provide smart aids to navigation services with the standardized format and to manage user authentication and access rights. To meet the requirements of the service platform, Keycloak, an open source OIDC implementation, was used for user authentication, and the S-100 feature catalogue versioning method was used for service management. To standardize internal service data to S-100, we designed a minimum standard format for mapping internal service data to S-100 data using JSON Schema.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.94-106
• /
• 2014

Schema matching is widely used in many applications, such as data integration, ontology merging, data warehouse and dataspaces. In this paper, we propose a novel matching technique that is based on the order of attributes appearing in the schema structure of query results. The appearance order embodies the extent of the importance of an attribute for the user examining the query results. The core idea of our approach is to collect statistics about the appearance order of attributes from the query logs, to find correspondences between attributes in the schemas to be matched. As a first step, we employ a matrix to structure the statistics around the appearance order of attributes. Then, two scoring functions are considered to measure the similarity of the collected statistics. Finally, a traditional algorithm is employed to find the mapping with the highest score. Furthermore, our approach can be seen as a complementary member to the family of the existing matchers, and can also be combined with them to obtain more accurate results. We validate our approach with an experimental study, the results of which demonstrate that our approach is effective, and has good performance.