2011Unpublished venueRequires access

Restructuring XML document — From the perspective of sorting

Zhaoyan Jin, Quanyuan Wu, Hua Fan

Open publisher page 1 citations

Abstract

Business applications often exchange or restructure large amounts of enterprise information. As XML has becomes the de facto standard of data representation and exchange format over the web, a massive amount of enterprise information is stored in XML. In XML data transformation, also called data exchange, a source XML document with its conforming schema is transformed to a target XML document which conforms to the target schema. Though XQuery and XSLT are recommended standard by W3C, they can only deal with small documents. In this paper, we model XML data transformation from the perspective of sorting, propose a three-phase transforming algorithm and prove the correctness of the algorithm. We assume XML document as data and its conforming semantic, and accomplish the transformation from sorting according to the order specified by target schema. Experiments show that our algorithm can not only transform XML documents efficiently, but also handle large XML documents with high scalability.

About this research paper

What this paper is about

Business applications often exchange or restructure large amounts of enterprise information. As XML has becomes the de facto standard of data representation and exchange format over the web, a massive amount of enterprise information is stored in XML. In XML data transformation, also called data exchange, a source XML document with its conforming schema is transformed to a target XML document which conforms to the target schema. Though XQuery and XSLT are recommended standard by W3C, they can only deal with small documents. In this paper, we model XML data transformation from the perspective of sorting, propose a three-phase transforming algorithm and prove the correctness of the algorithm. We assume XML document as data and its conforming semantic, and accomplish the transformation from sorting according to the order specified by target schema. Experiments show that our algorithm can not only transform XML documents efficiently, but also handle large XML documents with high scalability.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Business applications often exchange or restructure large amounts of enterprise information. As XML has becomes the de facto standard of data representation and exchange format over the web, a massive amount of enterprise information is stored in XML. In XML data transformation, also called data exchange, a source XML document with its conforming schema is transformed to a target XML document which conforms to the target schema. Though XQuery and XSLT are recommended standard by W3C, they can only deal with small documents. In this paper, we model XML data transformation from the perspective of sorting, propose a three-phase transforming algorithm and prove the correctness of the algorithm. We assume XML document as data and its conforming semantic, and accomplish the transformation from sorting according to the order specified by target schema. Experiments show that our algorithm can not only transform XML documents efficiently, but also handle large XML documents with high scalability.

Key concepts: Computer science, XML validation, XML Schema Editor, Efficient XML Interchange, Streaming XML, Document Structure Description, XML Encryption, XML Schema (W3C)

Related papers

Back to paper searchBrowse research topicsOriginal source
Restructuring XML document — From the perspective of sorting — Research Paper | ScholarLens