Search Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/68267
|Download PDF (Accepted manuscript) (Adobe Acrobat PDF, 284 KB)|
- Redundancy free mappings from relations to XML
- Liu, Chengfei; Liu, Jixue; Vincent, Millist W.
- Given the fact that relational and object-relational databases are the most widely used technology for storing data and that XML is the standard format used in electronic data interchange, the process of converting relational data to XML documents is one that occurs frequently. The problem that we address in this paper is an important one related to this process. If we convert a relation to an XML document, under what circumstances is the XML document redundancy free? In some allied work we fomally defined functional dependencies in XML (XFDs) and, based on this definition, formally defined redundancy in an XML document. We then introduced a normal form for an XML document (XNF) and showed that it is a necessary and sufficient condition for the elimination of redundancy. In this paper we address the problem of determining what slass of mappings map a relation in BCNF to an XML document in XNF. The class of mappings we consider is very general and allows arbitrary nesting of the original flat relation. Our mail result established a necessary and sufficient condition on the DTD induced by the mapping for it to be in XNF.
- Publication type
- Conference paper
- Lecture notes in computer science: Advances in Web-Age Information Management: proceedings of the 5th International Conference on Web-Age Information Management (WAIM 2004), Dalian, China, 15-17 July 2004 / Qing Li, Guoren Wang and Ling Feng (eds.), Vol. 2762, pp. 55-67
- Publication year
- Electronic data interchange; Object-relational databases; Relational databases; XML documents; XNF
- 0302-9743 (series ISSN)
- 9783540224181, 354022411
- Publisher URL
- Copyright © Springer-Verlag Berlin Heidelberg 2004. The accepted manuscript of the paper is reproduced here in accordance with the copyright policy of the publisher. The definitive version of the publication is available at www.springer.com.
- Full text
- Peer reviewed