Dependency-Preserving Normalization of Relational and XML Data

Kolahi, Solmaz

doi:10.1007/11601524_16

Cited by 11 publications

(20 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By Proposition 5.4, one may be tempted to think that if we translate this schema into XML, the situation will be similar; every XNF decomposition of the translated schema should lose some constraints. The following example, taken from [18], shows that this is not the case, as we can use the hierarchical structure of XML to obtain a dependency preserving XNF decomposition. The first three XFDs indicate how the instances of R are stored as XML trees conforming to D. Thus, for example, the first XFD indicates that all the tuples in R with the same value of attribute B are grouped together, in a tree that stores in its root the value of attribute B.…”

Section: Proposition 54 [4]mentioning

confidence: 99%

See 1 more Smart Citation

Normalization theory for XML

Arenas

2006

SIGMOD Rec.

View full text Add to dashboard Cite

show abstract

Section: Proposition 54 [4]mentioning

confidence: 99%

“…The approach shown in the previous example was proposed in [18], under the name of hierarchical translation of relational schemas, as a way to obtain dependency preserving decompositions of relational schemas. The advantages and limitations of this approach are explored in [18].…”

mentioning

confidence: 99%

Normalization theory for XML

Arenas

2006

SIGMOD Rec.

View full text Add to dashboard Cite

show abstract

“…Arenas and Libkin [2] has introduced a new information theoretical concept of relative information content of a position in the database and used it to justify Boyce-Codd normal forms. Kolahi and Libkin has successfully applied the concept for an information theoretic study on 3NF [9], XML design [10], and worst-case redundancy analysis [11]. Köhler [12] proposed and analyzed a new normal form for relational databases based on the idea of minimizing overall storage space and update costs.…”

Section: Related Workmentioning

confidence: 99%

Encoding Databases Satisfying a Given Set of Dependencies

Katona

Tichler

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Consider a relation schema with a set of dependency constraints. A fundamental question is what is the minimum space where the possible instances of the schema can be "stored". We study the following model. Encode the instances by giving a function which maps the set of possible instances into the set of words of a given length over the binary alphabet in a decodable way. The problem is to find the minimum length needed. This minimum is called the information content of the database. We investigate several cases where the set of dependency constraints consist of relatively simple sets of functional or multivalued dependencies. We also consider the following natural extension. Is it possible to encode the instances such a way that small changes in the instance cause a small change in the code.

show abstract

“…Proposition 1 (see [11]). For every 0 < ε < 1, one can find a 3NF relational schema given by a set of FDs F , an instance R of that schema and a position p in R such that Ric R (p|F ) < ε.…”

Section: Theorem 1 (See [2]) a Schema Given By Fds Is Well-designed mentioning

confidence: 99%

“…It was shown in [11] that one can produce XML designs capturing 3NF relational designs that do not have dependency-preserving BCNF decompositions in a way that accounts for all the constraints. This needs to be explored further, as it opens a possibility of storing relations in XML in a way that eliminates redundancies and guarantees dependency-preservation, even if there is no such relational representation.…”

Section: Open Problemsmentioning

confidence: 99%

Normalization Theory for XML

Libkin

Database and XMLTechnologies

View full text Add to dashboard Cite

Abstract. Specifications of XML documents typically consist of typing information (e.g., a DTD), and integrity constraints. Just like relational schema specifications, not all are good -some are prone to redundancies and update anomalies. In the relational world we have a well-developed theory of data design (also known as normalization). A few definitions of XML normal forms have been proposed, but the main question is why a particular design is good. In the XML world, we still lack universally accepted query languages such as relational algebra, or update languages that let us reason about storage redundancies, lossless decompositions, and update anomalies. A better approach, therefore, is to come up with notions of good design based on the intrinsic properties of the model itself. We present such an approach, based on Shannon's information theory, and show how it applies to relational normal forms as well as to XML design, for both native and relational storage.

show abstract

Dependency-Preserving Normalization of Relational and XML Data

Cited by 11 publications

References 16 publications

Normalization theory for XML

Normalization theory for XML

Encoding Databases Satisfying a Given Set of Dependencies

Normalization Theory for XML

Contact Info

Product

Resources

About