Designing Redundancy-Free XML Schema : A Smallest Closure Approach
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Article number | 1550005 |
| Journal / Publication | International Journal of Cooperative Information Systems |
| Volume | 24 |
| Issue number | 4 |
| Online published | 12 Oct 2015 |
| Publication status | Published - Dec 2015 |
Link(s)
Abstract
XML has too many low-level details that hinder high-level conceptual design. We therefore propose DTD graphs and XSD graphs as a mean for conceptual modeling of XML applications. Similar to document type definitions (DTDs) and XML schema definitions (XSDs), DTD graphs and XSD graphs are trees, and as such they can easily be mapped to DTDs and XSDs for implementation. Unlike DTDs and XSDs, DTD graphs and XSD graphs capture various high-level data semantics such as cardinality, ISA, participation, aggregation, categorization, and n-ary relationship. Furthermore, this paper also presents transformation rules between DTDs and a large class of XML Schemas and an algorithm that inputs users' requirements and outputs a DTD graph that has a minimum number of redundancy-free fragments. As a result of these good properties, the resulting DTD or XSD facilitates query processing and update.
Research Area(s)
- DTD graphs, DTDs, XSD graphs, XSDs
Citation Format(s)
Designing Redundancy-Free XML Schema : A Smallest Closure Approach. / Mok, Wai Yan; Fong, Joseph; Wong, Kenneth.
In: International Journal of Cooperative Information Systems, Vol. 24, No. 4, 1550005, 12.2015.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
