Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/39749

Download PDF (Accepted manuscript) (Adobe Acrobat PDF, -1 bytes)

Title

On transformation to redundancy free XML schema from relational database schema

Author(s)

Liu, Chengfei;  Liu, Jixue;  Guo, Minyi

Abstract

While XML is emerging as the universal format for publishing and exchanging data on the Web, most business data is still stored and maintained in relational database management systems. As a result, there is an increasing need to efficiently publish relational data as XML documents for Internet-based applications. One way to publish relational data is to provide virtual XML documents for relational data via an XML schema which is transformed from the underlying relational database schema, then users can access the relational database through the XML schema. In this paper, we discuss issues in transforming a relational database schema into corresponding schema in XML Schema. We aim to achieve high level of nesting while introducing no data redundancy for the transformed XML schema. In the paper, we first propose a basic transformation algorithm which introduces no data redundancy, then we improve the algorithm by exploring further nesting of the transformed XML schema.

Publication type

Conference paper

Source

Lecture notes in computer science: Proceedings of 'Web technologies and applications', the 5th Asia-Pacific Web Conference (APWeb 2003), Xian, China, 23-25 April 2003 / Xiaofang Zhou, Maria E. Orlowska and Yanchun Zhang (eds.), Vol. 2642, pp. 35-46

Publication year

2003

Keyword(s)

eXtensible markup language;  Relational databases;  Transformation;  XML;  XML schemas;  Information systems

Publisher

Springer

ISSN

0302-9743 (series ISSN)

ISBN

9783540023548, 3540023542

Publisher URL

http://dx.doi.org/10.1007/3-540-36901-5_4

Copyright

Copyright © Springer-Verlag Berlin Heidelberg 2003. The accepted manuscript of this paper is reproduced here in accordance with the copyright policy of the publisher. The definitive publication is available at www.springerlink.com.

Full text

Peer reviewed