Towards the faster transformation of XML documents

Dong Hoon Shin, Kyong Ho Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

XML is so flexible that several different schemas are often used even in the same application domain. To interchange XML documents between two parties, it is necessary to transform XML documents into ones that conform to the schema of a partner. Since a transformation is repeatedly applied to a large volume of XML documents, the transformation speed is important. This paper proposes a method for generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method consists of two steps: computing matches between internal nodes and generating XSLT scripts. Specifically, the proposed method considers many-to-one matches among cardinality nodes. The transformation of recursive structures is also supported. The proposed method generates XSLT scripts with fewer templates that are proportional to the number of the matches between recursive nodes. Experimental results show that the proposed method generates XSLT scripts that support the faster transformation of XML documents, compared with previous work.

Original languageEnglish
Pages (from-to)261-276
Number of pages16
JournalJournal of Information Science
Volume32
Issue number3
DOIs
Publication statusPublished - 2006 Jun 1

Fingerprint

XML
Interchanges

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Library and Information Sciences

Cite this

@article{e6c7772f948b43b1988c8a26f380c5b4,
title = "Towards the faster transformation of XML documents",
abstract = "XML is so flexible that several different schemas are often used even in the same application domain. To interchange XML documents between two parties, it is necessary to transform XML documents into ones that conform to the schema of a partner. Since a transformation is repeatedly applied to a large volume of XML documents, the transformation speed is important. This paper proposes a method for generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method consists of two steps: computing matches between internal nodes and generating XSLT scripts. Specifically, the proposed method considers many-to-one matches among cardinality nodes. The transformation of recursive structures is also supported. The proposed method generates XSLT scripts with fewer templates that are proportional to the number of the matches between recursive nodes. Experimental results show that the proposed method generates XSLT scripts that support the faster transformation of XML documents, compared with previous work.",
author = "Shin, {Dong Hoon} and Lee, {Kyong Ho}",
year = "2006",
month = "6",
day = "1",
doi = "10.1177/0165551506064391",
language = "English",
volume = "32",
pages = "261--276",
journal = "Journal of Information Science",
issn = "0165-5515",
publisher = "SAGE Publications Ltd",
number = "3",

}

Towards the faster transformation of XML documents. / Shin, Dong Hoon; Lee, Kyong Ho.

In: Journal of Information Science, Vol. 32, No. 3, 01.06.2006, p. 261-276.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Towards the faster transformation of XML documents

AU - Shin, Dong Hoon

AU - Lee, Kyong Ho

PY - 2006/6/1

Y1 - 2006/6/1

N2 - XML is so flexible that several different schemas are often used even in the same application domain. To interchange XML documents between two parties, it is necessary to transform XML documents into ones that conform to the schema of a partner. Since a transformation is repeatedly applied to a large volume of XML documents, the transformation speed is important. This paper proposes a method for generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method consists of two steps: computing matches between internal nodes and generating XSLT scripts. Specifically, the proposed method considers many-to-one matches among cardinality nodes. The transformation of recursive structures is also supported. The proposed method generates XSLT scripts with fewer templates that are proportional to the number of the matches between recursive nodes. Experimental results show that the proposed method generates XSLT scripts that support the faster transformation of XML documents, compared with previous work.

AB - XML is so flexible that several different schemas are often used even in the same application domain. To interchange XML documents between two parties, it is necessary to transform XML documents into ones that conform to the schema of a partner. Since a transformation is repeatedly applied to a large volume of XML documents, the transformation speed is important. This paper proposes a method for generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method consists of two steps: computing matches between internal nodes and generating XSLT scripts. Specifically, the proposed method considers many-to-one matches among cardinality nodes. The transformation of recursive structures is also supported. The proposed method generates XSLT scripts with fewer templates that are proportional to the number of the matches between recursive nodes. Experimental results show that the proposed method generates XSLT scripts that support the faster transformation of XML documents, compared with previous work.

UR - http://www.scopus.com/inward/record.url?scp=33745024069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745024069&partnerID=8YFLogxK

U2 - 10.1177/0165551506064391

DO - 10.1177/0165551506064391

M3 - Article

AN - SCOPUS:33745024069

VL - 32

SP - 261

EP - 276

JO - Journal of Information Science

JF - Journal of Information Science

SN - 0165-5515

IS - 3

ER -