Relative information capacity of simple relational database schemata
SIAM Journal on Computing
Schema equivalence in heterogeneous systems: bridging theory and practice
Information Systems - Special issue on extending database technology
WordNet: a lexical database for English
Communications of the ACM
Automating the transformation of XML documents
Proceedings of the 3rd international workshop on Web information and data management
Towards automating of document structure transformations
Proceedings of the 2002 ACM symposium on Document engineering
Automating XML document structure transformations
Proceedings of the 2003 ACM symposium on Document engineering
Evolution of XPath lists for document data selection
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
| Hi-index | 0.00 |
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.