The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2006 vol.18)
pp: 1082-1096
ABSTRACT
As XML data becomes more and more prevalent and as larger quantities of data find their way into XML documents, the need for quality XML data organization will only increase. One standard way of structuring data well is to reduce and, if possible, eliminate redundancy, while at the same time making the storage structures as compact as possible. In this paper, we present a methodology to generate XML storage structures where conforming XML documents are redundancy-free, and for most practical cases, are also fully compact. Our methodology assumes the input is a conceptual-model hypergraph. For the special case that every edge in the hypergraph is binary, we present a simple algorithm, guaranteed to always generate redundancy-free storage structures. We show, however, that generating a minimum number of redundancy-free storage structures is NP-hard. We therefore provide heuristics to guide the process and observe that these heuristics result in satisfactory solutions, which are often optimal. We then present a general algorithm for n{\hbox{-}}\rm ary edges and show that it generates redundancy-free storage structures. The general algorithm must overcome several problems that do not arise in the special case.
INDEX TERMS
XML data redundancy, compact XML storage structures, XML scheme generation.
CITATION
Wai Yin Mok, David W. Embley, "Generating Compact Redundancy-Free XML Documents from Conceptual-Model Hypergraphs", IEEE Transactions on Knowledge & Data Engineering, vol.18, no. 8, pp. 1082-1096, August 2006, doi:10.1109/TKDE.2006.125
33 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool