Integrity constraints play a fundamental role in defining semantics in both conventional databases and in XML documents. In this paper we generalize previous approaches to defining inclusion dependencies in XML. Previous approaches have considered only the case where the paths on the l.h.s. are child attributes of the same node and the paths on the r.h.s. of the dependency are child attributes of the same node, whereas we do not apply this restriction. We then give an axiom system for XINDs and prove that the system is sound and complete. As a corollary, we also show that the implication problem for XINDs is decidable. Finally we consider the relationship between inclusion dependencies in relational databases (INDs) and XINDs in XML documents and we show that for a very general class of mappings from a relational database to a set of XML documents, and IND is satisfied in a relational database if and only if the corresponding XIND is satisfied in the XML documents.
Lecture notes in computer science: Advanced web technologies and applications: Proceedings of the 6th Asia-Pacific Web Conference (APWeb 2004), Hangzhou, China, 14-17 April 2004,
Vol. 3007, pp. 224-233