XML的函数依赖

为了表达引起数据冗余的XML函数依赖,研究了XML中存在的复杂的多种形式的函数依赖约束,提出了一种DTD的路径语言,对于导航和定位XML文档的内容具有较强的表达能力.提出了一套XML模式及文档的形式化描述方法,进而提出了一种XML函数依赖(XFD)的定义.与以前的XML函数依赖的定义进行比较,展示了XFD可以表达更多的XML上存在的函数依赖,可以概括以前的基于路径表达式定义的XML函数依赖的约束能力.     

XML函数依赖集的逻辑蕴含

提出了一组适合于M.Arenas等人给定的XFD的推理规则并证明了推理规则集的正确性和完备性.在此基础上,研究了XFD的逻辑蕴含问题,提出了求解路径闭包算法和成员籍算法.     

The exchange from relational schemas to XML schemas based on semantic constraints

XML is the standard format for data exchange between inter-enterprise applications on the Internet. To facilitate data exchange, industry groups define public document type that specify the format of the XML data to be exchanged between their applications. In this paper, we propose a new method to solve the problem of automating the conversion of relational data into XML. During the conversion, we considers not only the structure of relational schemas, but also semantic constraints such as inclusion dependencies during the translation--it takes as input a relational schema where multiple tables are interconnected through inclusion dependencies and converts it into an X-Schema. Finally, in order to validate our proposal, we present experimental results using real schemas.     

强函数依赖及其在XML范式中的应用

本文用一种“强满足”的方法，把函数依赖的定义扩展，使其符合不完全XML文档的情况，并把这种函数依赖称作XFD。在此基础上，给出了XML文档的一种范式。     

基于树元组的函数依赖推理规则

对M．Arenas等人提出的基于树元组的XFD定义及相关概念进行了介绍。在这种XFD定义的基础上研究了XML的推理规则和逻辑蕴涵问题，提出了一组推理规则集并证明了推理规则的正确性和完备性，给出了求解路径闭包算法和成员籍算法。     

XML关键字问题的研究

关键字是数据库设计的一个重要部分,它们是数据模型和概念设计的基础。关键字对索引、XML数据的存档以及设计关系存储都是非常重要的。本文主要提出了XML文档关键字的定义,包括绝对关键字、相对关键字以及强关键字的概念,同时给出了关键字的推理规则。     

XML函数依赖

函数依赖在关系数据库中起着基本的作用,尤其是用在完整性约束和数据库设计方面。近年来已定义了XML上的函数依赖。本文采用了一种新的定义方式,即在树元组上定义函数依赖,同时给出了函数依赖的推理规则。     

保持语义约束的XML文档规范化

 从XML键导出了既保持语义约束又符合DTD结构约束的XML函数依赖,并基于DTD的规范化技术及XML的查询转换技术提出了保持语义的XML文档规范化方法,并对其应用实例作了详细的分析.     

BloomRouter： A Framework for Dissemination of Compressed XML Stream

As our best knowledge, in the Publish/Subscribe application environment, few research work has been done on the dissemination and routing of compressed XML （extended markup language） data. A high-speed compressed XML data routing and dissemination framework BloomRouter is proposed. In BloomRouter, a Bloom Filter based prefilte ring mechanism is used to filter out compressed XML elements that users do not care; after that an interval tree dis seminator forwards target elements to the corresponding end users by matching the incomming compressed XML elements with indexed users＇ query regions. Based on this framework, we can efficiently filter/query the compressed incoming XML data, and then route the query result to the corresponding subseriber.     

XML范式理论及规范化规则

针对XML模式设计中的规范化问题,总结出一套较系统的规范化理论,包括函数依赖、4种XML范式和2种XML规范化规则,并通过具体的实例,说明了这些XML规范化规则的应用.以此帮助解决XML实例文档出现的数据冗余和不一致问题.     

XML与关系数据库相互转换中的语义约束完整性

采用Shared Inlining方法,提出基于函数依赖的XML到关系的无损映射算法,使得原XML文档的内容和结构信息及语义约束完整地映射到关系数据库中.在此基础上利用外键连接与路径映射规则,提出基于语义约束的关系模式向XML模式的转换算法,以重构出原XML文档.提出的新观点是：映射得到的关系或XML文档的范式不但与映射算法有关,而且与XML文档或关系的规范化程度有关.定义了XML范式,提出XML文档与关系的相互转换中XML范式与关系范式对应关系的相关命题,并给出了相应证明.     

Twig Pattern Matching Based on Compressed Path Labeling Scheme

Holistic twig query processing techniques based on region encoding have been developed to minimize the intermediate results, namely, those root-to-leaf path matches that are not in the final twig results. These algorithms have to scan all the streams of tags in query patterns. However, useless path matches cannot be completely avoided. TJFast which is based on the labeling scheme of Extended Dewey has been proposed to avoid useless intermediate results, and it only needs to access the labels of the leaf query nodes. However, it don＇t concern about the characteristics of elements with the same parent, and it has to merge join all the intermediate results which are evaluated during the first phrase. We propose a new labeling scheme to compress the XML elements which have the same characteristic. Based on the compressed path-labeled streams, a new novel holistic twig query algorithm named CPJoin is designed. Finally, implementation results are provided to show that CPJoin has good performance on both real and synthetic data.     

基于属性预扫描的不确定性函数依赖挖掘

函数依赖是关系数据库和数据建模中所需的关键约束知识。在海量数据中挖掘函数依赖时为降低噪音干扰和提高效率,该文采用带有满意度函数依赖的概念及挖掘带有满意度函数依赖的算法(MFDD),对噪音进行测度与表达,并有效挖掘得到函数依赖最小集。利用对属性散列度的测度概念,在带有满意度函数依赖的理论框架内采用3条优化策略,实现了属性预扫描算法。结果表明:基于该算法可显著提高挖掘效率。     

TwigStack^＋： Holistic Twig Join Pruning Using Extended Solution Extension

XML has been used extensively in many applications as a de facto standard for information representation and exchange over internet. Huge volumes of data are organized or exported in tree-structured form and the desired information can be got by traversing the whole tree structure using a twig pattern query. A new definition, Extended Solution Extension, is proposed in this paper to check the usefulness of an element from both forward and backward directions. Then a novel Extended Solution Extension based algorithm, TwigStack^＋, is also proposed to reduce the query processing cost, simply because it can check whether other elements can be processed together with the current one. Compared with existing methods, query evaluation cost can be largely reduced. The experimental results on various datasets indicate that the proposed algorithm performs significantly better than the existing ones.     

对XMLDTD中的键和函数依赖的探讨

对基于DTD模式的XML的键和函数依赖做了进一步讨论。提出了关于XML的简化键、简化函数依赖的定义，分析了XML中的键和函数依赖的之间的区别和联系。     

基于树元组的XML文档中的多值依赖

XML模式设计是XML数据库设计的关键，同关系数据库相似，对引起XML数据更新异常的原因及消除更新异常的方法进行研究具有重要的意义。与Vincent等人不同，本文在DTD一级对XML文档中的多值依赖进行了研究。首先分析了XML文档模式设计的研究方法，其次，重新给出了XML树，树元组等的定义，消除了Arenas等人在定义模型“相等”上的二义性，并基于DTD提出了XML多值依赖的概念。最后，分析了XML中多值依赖的公理系统及蕴涵问题并指出了XML多值依赖未来的研究方向。     

基于DTD路径编码的XML逻辑蕴涵问题研究

由于DTD的复杂性,使得XFD的逻辑蕴涵问题研究比较困难.为了解决该问题,本文在M.Arenas等人给定的XFD定义基础上,提出了一种DTD路径编码方法,对它的性质进行了分析.编码后的DTD消除了部分XML平凡函数依赖,并能在线性时间内对XML函数依赖的逻辑蕴涵问题进行判定.提出了一个将XFD中的编码路径重新映射到DTD路径的算法,证明了它的正确性.     

结构化数据到XML数据的语义映射

XML的DTD机制不足以表现结构化数据的语义，本文在路径约束的基础上，提出一种新的语义映射机制，引入域的概念描述结构化数据到XML数据的结构映射，将结构化数据的平面结构映射为XML数据的树状结构，通过有域层次的键规则表达式，将结构化数据中分散在各表中的键的定义映射到XML数据中，利用域的概念和模板匹配的原理，引入域关系表达式及其扩展表达式来实现结构化数据以XML数据的语义映射，由此构成的语义映射机制可以和XML数据的模式抽取很好的集成在一起，体现数据的语义约束并为数据库对XML数据存储和查询的优化提供有效信息。