作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (13): 52-54. doi: 10.3969/j.issn.1000-3428.2009.13.018

• 软件技术与数据库 • 上一篇    下一篇

基于形式语言理论的Active XML重写算法

马海涛1,郝忠孝1,2   

  1. (1. 哈尔滨工业大学计算机科学与技术学院,哈尔滨 150001;2. 哈尔滨理工大学计算机科学与技术学院,哈尔滨 150080 )
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-07-05 发布日期:2009-07-05

Active XML Rewriting Algorithm Based on Formal Language Theory

MA Hai-tao1, HAO Zhong-xiao1,2   

  1. (1. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001; 2. School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-07-05 Published:2009-07-05

摘要: 主动XML(AXML)是指一部分数据直接给出,另一部分数据以Web Services调用方式隐含给出XML文档。研究AXML重写问题,给出AXML重写系统的形式化定义,提出一个基于树自动机理论的AXML文档重写算法,并证明该算法的正确性及有效性。实验数据表明,基于树自动机的AXML文档交换方法具有良好的执行效率。

关键词: 主动XML, 数据交换, 文档重写, 树自动机

Abstract: Active XML(AXML) is an XML document where some of the data is given explicitly while other parts are given intentionally, by means of embedded calls to Web services. This paper gives an AXML document, a specification describing intensional data and a target exchang schema. It formalizes the problem based on formal languages theory and provides an algorithm to solve it. It also presents an implementation of test environment of AXML exchange. Experimental result demonstrates that the algorithm based on tree automata can lead to the increase of efficiency on exchang AXML documents.

Key words: Active XML(AXML), data exchange, document rewriting, tree automata

中图分类号: