• Title/Summary/Keyword: XML 정규화

Search Result 22, Processing Time 0.028 seconds

An Implementation of the Canonical XML Algorithm (XML 정규화 알고리즘 구현)

  • 박기식;조인준;정회경
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.8
    • /
    • pp.1698-1707
    • /
    • 2003
  • These days, XML is accepted and used to e commerce market broadly. But by reason of XML document can exist same form logically but several other forms physically, several problems can happen in application that judge effectiveness as physical form such as XML digital signature. Therefore, it is recommending to propose and use canonical XML algorithm to change identical XML document physically equally logically in W3C to solve this problems. We implemented system that nm Canonical XML algorithm that suggested in W3C that can change to mon elaborate regular document. Thus, interoperable with other application that takes W3C recommendation Also, as well as use in digital signature system for web service is useful, use in several system that physical identify is required when it exchanges na document for web service interoperability are considered to be valuable. Moreover, Adding the transformation ability between universal encoding scheme and EUC­KR that is internal encoding scheme should be Canonical XML Algorithm that is suited to internal circumstances, and this should be a foundation technique of international interoperability confirmedness.

Design and Implement of Canonical XML Algorithm for Digital Signature System (전자서명 시스템을 위한 XML 정규화 알고리즘 설계 및 구현)

  • 유윤식;이강찬;전종홍;이원석;정회경
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.504-507
    • /
    • 2003
  • These days, XML is accepted and used to e-commerce market broadly. But by reason of XML document has autonomy of expression that can exist same form logically but several other forms physically, several problems ran happen in application that judge effectiveness as physical form such as XML digital signature. Therefore, it is recommending to propose and use Canonical XML algorithm to change identical XML document physically equally logically in W3C to solve this problems. We implemented system that run Canonical XML algorithm that suggested in W3C that can change to more elaborate regular document. Thus, interpretable with other application that takes W3C recommendation. Also, as well as use in digital signature system for web service is useful, use in several system that physical identify is required when it exchanges XML document for web service interoperability are considered to be valuable. Moreover, Adding the transformation ability between universal encoding scheme and EUC-KR that is internal encoding scheme should be Canonical XML Algorithm that is suited to internal circumstances, and this should be a foundation technique of international interoperability confirmedness.

  • PDF

Normalization of XQuery Queries for Efficient XML Query Processing (효율적인 XML질의 처리를 위한 XQuery 질의의 정규화)

  • 김서영;이기훈;황규영
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.5
    • /
    • pp.419-433
    • /
    • 2004
  • As XML becomes a standard for data representation, integration, and exchange on the Web, several XML query languages have been proposed. World Wide Web Consortium(W3C) has proposed XQuery as a standard for the XML query language. Like SQL, XQuery allows nested queries. Thus, normalization rules have been proposed to transform nested XQuery queries to semantically equivalent ones that could be executed more efficiently. However, previous normalization rules are applicable only to restricted forms of nested XQuery queries. Specifically, they can not handle FLWR expressions having nested expressions in the where clause. In this paper, we propose normalization rules for XQuery queries by extending those for SQL queries. Our proposed rules can handle FLWR expressions haying nested expressions in every clause. The major contributions of this paper are as follows. First, we classily nesting types of XQuery queries according to the existence of correlation and aggregation. We then propose normalization rules for each nesting type. Second, we propose detailed algorithms that apply the normalization rules to nested XQuery queries.

Normalization of XQuery Queries fur Efficient XML Query Processing (효율적인 XML 질의 처리를 위한 XQuery 질의의 정규화)

  • 김서영;이기훈;황규영
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.136-138
    • /
    • 2004
  • XML 이 웹 상에서의 정보 표현, 통합, 교환을 위한 표준이 됨에 따라 다양한 XML 질의 언어들이 제안되었으며, World Wide Web Consortium(W3C)은 XQery를 XML 질의 언어의 표준으로 권고하였다. XQuery는 SQL과 유사하게 중첩 질의를 허용하므로, 중첩된 XQuery 질의를 동일한 의미를 가지면서 보다 효율적으로 실행될 수 있는 질의로 변환하는 정규화 규칙들이 제안되었다. 그러나 제안된 정규화 규칙들은 제한적인 형태의 중첩 질의에만 적용되는 문제점을 가지고 있다 특히, FLWR 표현식의 where 절에 있는 중첩을 처리할 수 없다. 본 논문에서는 SQL 질의의 정규화 규칙들을 확장하여 FLWR 표현식의 모든 절에 나타나는 중첩을 처리할 수 있는 XQuery 질의의 정규화 규칙들을 제안한다 이를 위해 먼저, 상관과 집계의 유무에 따라 XQuery 질의의 중첩 유형을 분류하고, 각 유형 별로 정규화 규칙들을 제안한다 다음으로, 중첩된 XQuery 질의에 정규화 규칙들을 적용하는 세부 알고리즘을 제안한다.

  • PDF

Algorithm of XML and SOAP Messages Canonicalization (XML 및 SOAP 메시지 정규화 알고리즘)

  • Jeong, Hoe-Gyeong
    • The Journal of Engineering Research
    • /
    • v.6 no.1
    • /
    • pp.125-137
    • /
    • 2004
  • This paper implemented system that run Canonical XML and SOAP messages algorithm. So, can change to more elaborate regular document. Thus, interoperable with other application that takes W3C recommendation. Also, use in several system that physical identify is required when it exchange XML and SOAP messages for web service interoperability. Moreover, Adding the transformation ability between universal encoding scheme and EUC-KR that is internal encoding scheme should be Canonical XML and SOAP messages algorithm that is suited to internal circumstances, and this should be a foundation technique of international interoperability confirmedness.

  • PDF

A XML Canonicalization System for Digital Signature on Mobile Environment (모바일 환경에서의 디지털 서명을 위한 XML 정규화 시스템)

  • Yu, Lei;Hong, Xian-Yu;Yoon, Hwa-Mok;Choi, Bong-Kyu;Jung, Hoe-Kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.803-806
    • /
    • 2007
  • Along with the developing of mobile communication technology, plenty of data transmission turn into possible in mobile environment. As the foundation, it can provide diverse mobile service. Especially the service which use electronic signature, and as the transmission of XML technology among the terminal digital signature information. By now, allowed plenty of validity confirmation questions that the digital signatures about the characteristic induced application of physical property XML. For this question, it can be solved through XML by Canonical XML 1.0 standards provided in W3C. But, because the question in the XML namespace attribute inheritance, proposed the restrictive solution. In order to solve this problem, proposes candidate plan of Canonical XML 1.1 standardized in W3C, and also even more standardization. In this paper, in order to support the widespread XML standardization in the moving environment. Standardizes Canonical XML 1.1 standard as the underlies, safeguarding the theoretical mutual identity of the XML documents, and constructing and realizing the XML standardization system.

  • PDF

A Suffix Tree Approach for Efficient XML Path Indexing (접미어 트리 구조를 이용한 효율적인 XML 경로 인덱싱)

  • 이덕형;원정임;노관준;윤지희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.88-90
    • /
    • 2002
  • 최근 인터넷 상에서 XML 문서의 사용이 급속도로 보편화, 일반화됨 따라 정보 검색을 위한 다양한 XML 질의 언어가 제안되고 있다. XML 질의의 공통 특징으로서 ‘*’ 문자 등을 사용한 정규화 경로식(regular path expression)에 의한 손쉬운 구조정보 검색 기능을 들 수 있다. 본 논문에서는 접미어 트리(suffix tree)를 이용한 새로운 경로 인덱싱 기법을 제안한다. 제안하는 기법에서는 XML 문서상의 각 경로를 축약된 유일한 문자열로 인코딩하며, 인코딩 된 각 문자열의 모든 접미어 정보를 인덱스에 저장한다. 본 기법은 일반 정규화 경로식을 포함하는 구조질의를 매우 효율적으로 처리하며, 또한 경로 정보가 부정확하게 기술된 경우에도 관사 질의 처리를 효과적으로 처리할 수 있다.

  • PDF

A Transformation of XML DTD to Relational Database Schema Using Functional Dependency (함수적 종속관계를 이용한 XML DTD의 관계형 스키마 변환)

  • Lee Jung-hwa;Lee Man-sik;Yun Hong-won
    • 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.

Correction for Hangul Normalization in Unicode (유니코드 환경에서의 올바른 한글 정규화를 위한 수정 방안)

  • Ahn, Dae-Hyuk;Park, Young-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.2
    • /
    • pp.169-177
    • /
    • 2007
  • Hangul text normalization in current Unicode makes wrong Hangul syllable problems when using with precomposed modern Hangul syllables and composing old Hangul by using conjoining-Hangul Jamo and compatibility Hangul Jamo. This problem comes from allowing incorrect normalization form of compatibility Hangul Jamo and Hangul Symbol and also permitting to use conjoining-Hangul Jamo mixture with precomposed Hangul syllable in Unicode Hangul composing rule. It is caused by lack of consideration of old Hangul and/or insufficient understanding of Hangul code processing when writing specification for normalization forms in Unicode. Therefore on this paper, we study Hangul code in Unicode environment, specifically problems of normalization used for Web and XML, IDN in nowadays. Also we propose modification of Hangul normalization methods and Hangul composing rules for correct processing of Hangul normalization in Unicode.

Correction for Hangul Normalization (올바른 한글 정규화를 위한 수정 방안)

  • Ahn, Dae-Hyuk;Park, Young-Bae
    • Annual Conference on Human and Language Technology
    • /
    • 2006.10e
    • /
    • pp.73-80
    • /
    • 2006
  • 현재 유니코드에서 한글텍스트의 정규화 기법은 완성형 현대한글 음절과 옛 한글을 표현하는 조합형 한글 그리고 호환 자모등과 같이 사용할 경우 원래의 글자와는 전혀 다른 글자의 조합을 만들어내는 문제점이 있다. 이러한 문제점은 호환 한글 자모 및 기호들의 잘못된 정규화 변환과 유니코드의 한글자모 조합 규칙에서 자모와 완성형 현대한글 음절을 다시 조합하여 한글음절로 사용 할 수 있게 허용한 때문이다. 이는 정규화 형식을 처음 작성할 당시 옛 한글의 사용을 고려하지 않았거나, 한글에 대한 올바른 이해가 부족한 상태에서 작성 된데 따른 결과라 하겠다. 따라서 본 연구에서는 유니코드 환경에서의 한글코드와 특히 최근 들어 Web을 비롯하여 XML과 IDN에서 필연적으로 사용하는 정규화에 따른 문제점을 파악하고 이들을 올바르게 처리하기 위한 정규화의 수정 방안과 조합형 한글의 조합규칙에 대한 수정 방안을 제안한다.

  • PDF