On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Relational Databases for Querying XML Documents: Limitations and Opportunities
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
XBench - A Family of Benchmarks for XML DBMSs
Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
A Rule-Based Conversion of a DTD to a Conceptual Schema
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
XMach-1: A Benchmark for XML Data Management
Datenbanksysteme in Büro, Technik und Wissenschaft (BTW), 9. GI-Fachtagung,
The XML Tree Model - toward an XML conceptual schema reversed from XML Schema Definition
Data & Knowledge Engineering
A relational data harmonization approach to XML
Journal of Information Science
Design non-recursive and redundant-free XML conceptual schema with hypergraph
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Hi-index | 0.00 |
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.