Designing Good Semi-structured Databases

Lee, Sin Yeung; Lee, Mong Li; Ling, Tok Wang; Kalinichenko, Leonid A.

doi:10.1007/3-540-47866-3_9

Cited by 10 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, only [6] and [5] provide works that parallel our research efforts here. [6] defines a schema called S3-Graph.…”

Section: Related Workmentioning

confidence: 99%

“…[6] defines a schema called S3-Graph. S3-Graph makes no distinction between element node and attribute node and does not specify cardinality on the schema.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore S3-Graph doesn't lend itself to XML definition. To identify redundancy in S3-Graph, [6] defines a dependency constraint called SS-Dependency. A S3-Graph is in S3-NF if there is no transitive SS-dependency.…”

Section: Related Workmentioning

confidence: 99%

“…Furthermore, S3-NF may not remove anomalies such as like partial dependency and path anomaly. In contrast, NF-SS is designed to handle more general situations and therefore, subsumes and extends that of [6].…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

NF-SS: A Normal Form for Semistructured Schema

Ling

Lee

et al. 2002

Conceptual Modeling for New Information Systems Technologies

Self Cite

View full text Add to dashboard Cite

Abstract. Semistructured data is becoming increasingly important for web applications with the development of XML and related technologies. Designing a "good" semistructured database is crucial to prevent data redundancy, inconsistency and undesirable updating anomalies. However, unlike relational databases, there is no normalization theory to facilitate the design of good semistructured databases. In this paper, we introduce the notion of a semistructured schema and identify the various anomalies that may occur in such a schema. A Normal Form for Semistructured Schemata, NF-SS, is proposed. A semistructured schema in NF-SS guarantees minimal redundancy and hence no undesirable updating anomalies for the associated semistructured databases. Furthermore, a semistructured schema in NF-SS gives a more reasonable representation of real world semantics. We develop an iterative algorithm based on a set of heuristic rules to restructure a semistructured schema into a normal form. These design methods also provide insights into the normalization task for semistructured databases.

show abstract

“…To the best of our knowledge, only [6] and [5] provide works that parallel our research efforts here. [6] defines a schema called S3-Graph.…”

Section: Related Workmentioning

confidence: 99%

“…[6] defines a schema called S3-Graph. S3-Graph makes no distinction between element node and attribute node and does not specify cardinality on the schema.…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

NF-SS: A Normal Form for Semistructured Schema

Ling

Lee

et al. 2002

Conceptual Modeling for New Information Systems Technologies

Self Cite

View full text Add to dashboard Cite

show abstract

“…Condition 4 removes global redundancies among a set of components in a NF schema diagram. Note that other normal forms proposed for semistructured data, like S3-NF [9] and XNF [7] do not provide similar definitions.…”

Section: Is Department (Dname Course (Code Title Student (Number mentioning

confidence: 99%