ComputingComputer ScienceInformation SystemsDatabasesKnowledge RepresentationNatural Language ProcessingData ModelingData NormalizationDatabase NormalizationRelational AlgebraRelational Data ModelXml DatabasesFunctional Dependency ModelingFunctional Dependency TheoryNormal Form RepresentationNormal FormsNormalizationNormalization AlgorithmsNormalization TheoryUpdate Anomalies
This paper takes a first step towards the design and normalization theory for XML documents. We show that, like relational databases, XML documents may contain redundant information, and may be prone to update anomalies. Furthermore, such problems are caused by certain functional dependencies among paths in the document. Our goal is to find a way of converting an arbitrary DTD into a well-designed one, that avoids these problems. We first introduce the concept of a functional dependency for XML, and define its semantics via a relational representation of XML. We then define an XML normal form, XNF, that avoids update anomalies and redundancies. We study its properties and show that it generalizes BCNF and a normal form for nested relations when those are appropriately coded as XML documents. Finally, we present a lossless algorithm for converting any DTD into one in XNF.
26
Incomplete Information in Relational Databases
Tomasz Imieliński, Witold Lipski · Journal of the ACM · 1984 · 1K citations · Full text
Semantics of programming languages: structures and techniques
Choice Reviews Online · 1993 · 422 citations