XML中函数逼近的完备性和可判定性
Completeness and Decidability Properties for Functional Dependencies in XML
摘要：
XML作为Internet上数据表示和交换的标准，在信息存储和检索方面具有重要意义。然而XML提供的语义内容很少，因此有几篇论文讨论了如何提高XML的语义表达能力。其中最重要的方法是在XML中定义完整性约束。在一篇配套文章中，我们定义了XML中的强函数依赖（XFD）。我们还提出了一套公理推理的含义XFD和证明了公理系统是健全的任意XFD。在本文中，我们证明了公理也是完整的一元XFD（XFD与一个单一的路径上的l.h.s.）。本文的第二个贡献是证明了一元XFD的蕴涵问题是可判定的，并给出了一个线性时间算法。
英文摘要：
XML is of great importance in information storage and retrieval because of its recent emergence as a standard for data representation and interchange on the Internet. However XML provides little semantic content and as a result several papers have addressed the topic of how to improve the semantic expressiveness of XML. Among the most important of these approaches has been that of defining integrity constraints in XML. In a companion paper we defined strong functional dependencies in XML(XFDs). We also presented a set of axioms for reasoning about the implication of XFDs and showed that the axiom system is sound for arbitrary XFDs. In this paper we prove that the axioms are also complete for unary XFDs (XFDs with a single path on the l.h.s.). The second contribution of the paper is to prove that the implication problem for unary XFDs is decidable and to provide a linear time algorithm for it.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
