Sorting Based XML Data Exchange Algorithm
Ke Ren · 2014
In XML data exchange,XQuery and XSLT transform the XML document in memory in tree form,so they are not very efficient,and only can handle small documents.In order to transform large-scale XML documents efficiently, this paper defined the table of a schema,and proposed a sorting based three-phase XML data exchange algorithm.First, the algorithm transforms the XML document into a table,then,it sorts the table according to the target schema,and finally,it constructs a target XML document with the sorted table.The experiments show that the proposed algorithm can not only transform XML documents efficiently,but also be scalable to large-scale XML documents.