会议专题

An Algorithm for Checking Termination of Active XML Documents Materialization

Introducing Web services into XML documents, Active XMLfAXML for short) brings more flexibility and dynamics, but also some new problems. Termination of materializing AXML documents is such a problem to XML documents and is undecidable in general case. This paper develope the termination problem of AXML documents materialization and propose algorithms running polynomial time to solve it under some restricts for AXML schema definitions. The main idea of our algorithm is to decide the termination problem by building corresponding AXML schema dependent graph and checking the acyclic of the graph. Finally, the correctness of the algorithm is also proved.

HaiTao Ma Yan Zhu

College of Electronic Information Northeastern University at Qinhuangdao Qinhuangdao China College of Information Science and Engineering Yanshan University Qinhuangdao China

国际会议

2010 International Conference on E-Health Networking,Digital Ecosystems and Techonlogies(2010电子健康网络、数字生态系统和技术国际会议 EDT 2010)

深圳

英文

228-231

2010-04-17(万方平台首次上网日期,不代表论文的发表时间)