Abstract
On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 660-674 |
| Number of pages | 15 |
| Journal | ACM Transactions on Internet Technology |
| Volume | 5 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1 2005 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
Cite this
}
Taxonomy of XML schema languages using formal language theory. / Murata, Makoto; Lee, Dongwon; Mani, Murali; Kawaguchi, Kohsuke.
In: ACM Transactions on Internet Technology, Vol. 5, No. 4, 01.12.2005, p. 660-674.Research output: Contribution to journal › Article
TY - JOUR
T1 - Taxonomy of XML schema languages using formal language theory
AU - Murata, Makoto
AU - Lee, Dongwon
AU - Mani, Murali
AU - Kawaguchi, Kohsuke
PY - 2005/12/1
Y1 - 2005/12/1
N2 - On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
AB - On the basis of regular tree grammars, we present a formal framework for XML schema languages. This framework helps to describe, compare, and implement such schema languages in a rigorous manner. Our main results are as follows: (1) a simple framework to study three classes of tree languages (local, single-type, and regular); (2) classification and comparison of schema languages (DTD, W3C XML Schema, and RELAX NG) based on these classes; (3) efficient document validation algorithms for these classes; and (4) other grammatical concepts and advanced validation algorithms relevant to an XML model (e.g., binarization, derivative-based validation).
UR - http://www.scopus.com/inward/record.url?scp=33644699458&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33644699458&partnerID=8YFLogxK
U2 - 10.1145/1111627.1111631
DO - 10.1145/1111627.1111631
M3 - Article
AN - SCOPUS:33644699458
VL - 5
SP - 660
EP - 674
JO - ACM Transactions on Internet Technology
JF - ACM Transactions on Internet Technology
SN - 1533-5399
IS - 4
ER -