Active XML Schema Rewriting Based on Tree Automata Theory

摘要：

An Active XML(AXML for short) is an XML document where some of the data is given explicitly while other parts are defined only intentionally by means of embedded calls to Web services. Introducing intentional data, it brings many new problems to XML documents. The problems of document and schema rewriting are fundamental in practice. In this paper, we try to to solve AXML rewriting problems by using tree automata. Firstly, we define an extended tree automaton, AXML schema tree automaton(ASTA), which can efficiently describe the set of all AXML documents conforming a given schema. Based on ASTA, then we propose an algorithm for deciding one AXML schema can rewrite into the other one performing in polynomial time. Finally, the correctness of our algorithm for checking AXML schema rewriting is also proved.

作者: HaiTao Ma Yan Zhu

作者单位: Department of Electronic Information Northeastern University at Qinhuangdao Qinhuangdao China College of Information Science and Engineering Yanshan University Qinhuangdao China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 746-750

在线出版日期: 2010-10-29（万方平台首次上网日期，不代表论文的发表时间）