一种Active XML模式重写算法  

Algorithm for Rewriting Active XML Schema

作　　者：马海涛[1] 朱燕[2] 郝忠孝[1,3] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 [2]燕山大学信息科学与工程学院,秦皇岛066004 [3]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080

出　　处：《计算机科学》2009年第5期163-165,168,共4页Computer Science

基　　金：黑龙江省自然科学基金(F2006-01)资助

摘　　要：基于树自动机理论,研究了Active XML(简记为AXML)模式重写问题,提出了一种多项式时间的AXML模式重写判定算法,并对算法进行了实现。实验结果证明了所提算法用于判定AXML模式重写的优越性。The problem of schema rewriting is a fundamental and usually has a higher complexity. We defined an extended problem of Active XML（AXML for short） data exchange tree automaton,AXML schema tree automaton（ASTA）, which can efficiently describe the set of all AXML documents that conform to the given schema. Then based on ASTA automata, we proposed an algorithm performed in polynomial time for deciding whether one AXML schema can rewrite into the other one. Finally, the experimental results prove that our algorithm for checking AXML schema rewriting can be more efficiency than existing algorithm.

关 键 词：ACTIVE XML ACTIVE XML模式 树自动机 模式重写 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]