2009 Ninth International Conference on Hybrid Intelligent Systems 2009
DOI: 10.1109/his.2009.276
|View full text |Cite
|
Sign up to set email alerts
|

XML Functional Dependency and Schema Normalization

Abstract: Normalization theory is necessary for designing a good XML document. A good document means that it has minimal redundancy. The research on XML functional dependency and normalization is still an open problem. This paper first presents a path language of XML model, then proposes a new kind of XML functional dependency (XFD) that has stronger expression ability to XML functional dependency that can result in redundancies. In this paper, the problems of XFD logical implication and XFD closure are studied and a gr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2010
2010
2014
2014

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 14 publications
(15 reference statements)
0
4
0
Order By: Relevance
“…Executing the "while" loop repeatedly before Q′=∅ or Q′ has been the union set of some elements from BASIS. W:=∅; (10) for g i ∈BASIS do (11) {if g i ⊂Q′ then (12) {W:=W∪g i ;} (13) if Q′≠∅ and Q′≠W then do (14) {change-flag:= 'T'; (15) BASIS:= MB{BASIS∪Q′};}}} (16)return(BASIS) End…”
Section: B1 Algorithm Descriptionmentioning
confidence: 99%
See 3 more Smart Citations
“…Executing the "while" loop repeatedly before Q′=∅ or Q′ has been the union set of some elements from BASIS. W:=∅; (10) for g i ∈BASIS do (11) {if g i ⊂Q′ then (12) {W:=W∪g i ;} (13) if Q′≠∅ and Q′≠W then do (14) {change-flag:= 'T'; (15) BASIS:= MB{BASIS∪Q′};}}} (16)return(BASIS) End…”
Section: B1 Algorithm Descriptionmentioning
confidence: 99%
“…Since the size of BASIS is at most m, the time cost of the operation is O(m 2 ). The time complexity of the "for" loop is O(m 2 ) of step (10). In step (4), it is possible to examine whether n dependencies change the BASIS value or not.…”
Section: C13 Time Complexity Of the Algorithmmentioning
confidence: 99%
See 2 more Smart Citations