| 基于上下文的异构文档类型定义匹配 |
| |
| 引用本文： | 韩恺,岳丽华,龚育昌.基于上下文的异构文档类型定义匹配[J].小型微型计算机系统,2005,26(2):256-260. |
| |
| 作者姓名： | 韩恺 岳丽华 龚育昌 |
| |
| 作者单位： | 中国科学技术大学,计算机科学与技术系,安徽,合肥,230026 |
| |
| 基金项目： | 中科院知识创新项目“信息融合关键技术预先研究”(K2 CX0 10 1)资助 |
| |
| 摘 要： | XML文档的模式匹配是许多应用中的重要步骤．提出一种匹配算法来发现不同DTD中对应的元素和属性，通过转化规则将DTD转化成一个有向图模型，先给出了两个DTD树之间的匹配算法，然后将其推广一般的DTD图匹配的情形．匹配算法中在考察DTD节点的相似性时，除考虑标签语义和基数约束之外，研究了上下文语义对节点相似性的影响．
|
| 关 键 词： | 可扩展标识语言 文档类型定义 上下文 匹配 |
| 文章编号： | 1000-1220(2005)02-0256-05 |
Context Based Matching of Heterogeneous DTDs |
| |
| HAN Kai,YUE Li-hua,GONG Yu-chang.Context Based Matching of Heterogeneous DTDs[J].Mini-micro Systems,2005,26(2):256-260. |
| |
| Authors: | HAN Kai YUE Li-hua GONG Yu-chang |
| |
| Abstract: | Schema matching of XML documents is a critical problem in many applications. This paper presented an approach to find potential matching elements of different DTDs. Firstly a DTD was converted into a directed graph model by using a set of transformation rules. An algorithm for matching two DTD trees was presented and then it was extend to deal with the cases when DTD are not trees. The matching algorithm consider the similarity of DTD nodes based on name semantics, cardinality constraints, and especially on context semantics. |
| |
| Keywords: | xml DTD context matching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
