Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10321227 | Data & Knowledge Engineering | 2005 | 17 Pages |
Abstract
DTD has been widely used as the schema language for XML documents. A DTD describes the structure of a collection of similar XML documents. The consistency problem of XML DTDs concerns the question that given a DTD D, if there exists any finite XML document that conforms to D. This issue is important because one wants to know whether a DTD specification is meaningful. In this paper, we formalize the notion of the consistency of DTDs, identify a sufficient and necessary condition for a DTD to be consistent, and propose a linear algorithm, DTDCon, for the consistency checking problem.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Shiyong Lu, Yezhou Sun, Mustafa Atay, Farshad Fotouhi,