• Journal of KIISE:Databases
• /
• v.35 no.5
• /
• pp.411-420
• /
• 2008

The number of XML documents, which are widely used as a standard method for information expression and exchange in the web-based environment, increases rapidly along with the growing production of large XML documents. Many studies have been made to store and retrieve these XML documents on RDBMS, among which Shared Inlining storage method has a higher level of retrieval efficiency. The Shared Inlining method is the technique that analyzes the DTD information and stores the XML document in RDBMS by dividing for each node component. This study proposes the technique to resolve the overlapping problem that occurs in the element with several child nodes in the existing Shared Inlining method. The suggested method stores the XML document in the Shared Inlining structures appropriate to the DTD definition and enhances the accuracy of retrieval.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.87-90
• /
• 2005

XML(eXtensible Markup Language)은 웹 상의 데이터를 표현하고, 교환하기 위한 표준 언어로써 XML 로 표현된 문서를 관계형 데이터베이스 관리시스템(RDBMS)에 저장하고 관리하는 기법에 대한 연구[1][2][3]가 활발히 진행되어 왔다. 이러한 연구들은 DTD(Document Type Definition)를 입력 받아 해당 DTD 에서 관계형 스키마를 추론하는 기법을 사용한다. 하지만, 기존의 연구들은 DTD 간소화 절차를 적용하기 때문에 DTD 내에서 추론될 수 있는 의미적인 부분들이 스키마 생성 시에 보존이 되지 못한다. 또한, 기존의 연구들은 XML 데이터의 내용(content)와 구조(structure) 정보만을 저장하는데 초점이 맞춰져 있기 때문에, XML 문서 저장 시 데이터의 무결성을 보장하기 위해 저장프로시져나 트리거를 이용해야 하는 번거로움이 생긴다. 본 논문에서는 [3]의 연구에서 제시한 Inlining 기법을 기반으로 기존의 Inlining 기법의 문제점인 DTD 에서 추론할 수 있는 의미적인 부분의 손실을 관계형 스키마로 보존하는 방법과 효율적인 릴레이션 생성을 위해 개선된 Inlining 기법을 제시한다.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.773-781
• /
• 2006

XML is a standard language to express and exchange the data over the web. Recently, researches about techniques that storing XML documents into RDBMS and managing it have been progressed. These researches use a technique that are receiving the DTD document as an input and generate the relational schema from it. Existing researches, however, do not consider the semantic preservation because of the simplification of the DTD. Further, because existing studies only focus on the preservation technique to store information such as content and structure, there is a troublesomeness that have to use the stored-procedure or trigger for the data integrity during the stores of XML documents. This paper proposes a improved Inlining technique to create effective relations and to preserve semantics which can be inferred from DTD.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.1-11
• /
• 2004

In this paper. we propose a storage system for XML documents using relational databases. Additional processing is required to store XML documents in the relational databases due to the discrepancy between XML structures and relational schema. This study aims to store XML documents with DTD in the relational databases. We propose the association inlining that exploits shred inlining and hybrid inlining and avoids relation fragments and excessive joins. Experiments show some improvements in the performance with the proposed method. The information of the storage structures is extracted from the simplified DTD. Existing map classes are extended in order to map various structures of XML to relational schema. Map classes are defined for various structures such as elements with multiple values, elements with multiple super elements, and elements with recursive structures through analyzing XML documents. Map files that are XML structures and used in generating SQL statements are created by using the extracted information of storage structures and map classes.

• Journal of Information Technology Services
• /
• v.10 no.3
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1604-1609
• /
• 2004

We have to convert XML DTD into relational database schema for storing XML Document at relational database. Hybrid inlining algorithm are used for converting XML DTD to relational database schema. But this method have some problem. That is the relational database schema have N:N relationship are created according this method are not satisfied with third normal from. Therefore, We proposed Extended Hybrid inlining algorithm for solving this problem in this paper.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1021-1030
• /
• 2004

When any data-centric XML documents are stored and managed in RDBMS, schema extracting from XML Schema is an imminent problem. Furthermore, when they are stored in partitioned way on created table, lots of null values will be produced and/or be increased cost for join, so we need a solution to solve these problems. This paper proposes a Schema Hybrid Inlining technique to generate relational schema of XML documents. The suggested technique creates a relational schema based on the XML Schema graph. Also, the technique expands the legacy Inlining method by manual and heuristic processing table generation method of cardinality and in-degree. Then, an ancestor node, terminal node, and creating a new table on the derived relation in this technique. DTD-dependent storage method uses partitioned storing and relation path element information reformed structured-searching method to reduce joining operation cost that is a weak point of it.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.1505-1508
• /
• 2003

XML DTD 매칭은 데이터 통합이나 데이터 웨어하우스, 웹 마이닝, 전자상거래, 의미적 질의 처리등과 같은 데이터베이스 관련 응용분야에서 수행해야 할 근본적인 연구 분야이다. 웹이 발전됨에 따라 웹 상의 데이터 교환의 표준인 XML로 많은 데이터를 표현하게 되었고, 이 XML DTD에 대한 매칭이 주된 연구 분야로 대두되었다. XML 스키마는 플랫 구조인 기존의 관계형 데이터베이스 스키마와는 달리 계층적인 트리 구조로 이루어져 DTD를 직접 비교하기가 어렵다. 본 논문에서는 계층적 구조인 XML DTD의 계층적 구조 정보와 무결성 제약조건을 추출하여 일차원적인 직렬 구조로 변환한 후, 유사한 DTD를 매칭하는 방법을 제안한다.

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

AVASWI 시스템이 기존의 아바타 시스템과 다른 점은 아바타를 표현하기 위하여 GIF나 Flash등을 이용하지 않고 W3C의 2D 그래픽 표준인 SVG를 이용하는 것이다. SVG는 XML의 서브셋으로서 SVG를 저장하기 위해서는 XML을 위한 저장소를 이용할 수 있으나, SVG는 기존의 다른 XML과 다르게 속성과 그에 대한 값이 매우 중요한 역할을 수행한다. 이에 본 논문에서는 SVG를 효과적으로 저장하기 위하여 기존의 Shared-Inlining방법을 확장한 Extended-Inlining방법을 설계, 구현하였다.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.643-650
• /
• 2009

As one of typical techniques for acquiring bio-information, microarray has contributed greatly to development of bioinformatics. Although it is established as a core technology in bioinformatics, it has difficulty in sharing and storing data because data from experiments has huge and complex type. In this paper, we propose a new method which uses the feature that microarray data format in MAGE-ML, a standard format for exchanging data, has frequent structurally similar patterns. This method constructs compact database by simplifying MAGE-ML schema. In this method, Inlining techniques and newly proposed classification techniques using structural similarity of elements are used. The structure of database becomes simpler and number of table-joins is reduced, performance is enhanced using this method.