• 论文 •    

一种改进的可扩展标记语言查询增量维护算法

胡孔法,刘海东,陈崚,达庆利   

  1. 1.扬州大学 信息工程学院,江苏扬州225009;2.东南大学经济管理学院,江苏南京210096
  • 出版日期:2008-11-15 发布日期:2008-11-25

Improved extensible markup language query incremental maintenance algorithm

HU Kong-fa, LIU Hai-dong, CHEN Ling, DA Qing-li   

  1. 1.College of Information Engineering, Yangzhou University, Yangzhou 225009, China;2.School of Economics & Management, Southeast University, Nanjing 210096, China
  • Online:2008-11-15 Published:2008-11-25

摘要: 为降低可扩展标记数据查询执行器重新构建的代价,提出了一种基于树型结构的可扩展标记语言查询增量维护算法。该算法利用树型结构进行可扩展标记语言数据流查询执行器增量维护,利用自动机来表示状态转换,从而实现了对可扩展标记语言树型结构的动态维护,避免了在没有文档类型定义情况下出现的环形结构的复杂操作,减少了维护时间和状态转换数量。实验表明,基于树型结构的可扩展标记语言查询增量维护算法能够以有限转换路径为代价,有效地完成可扩展标记语言数据流持续查询执行器的动态维护,减少了增量维护时间和状态转换数量。

关键词: 可扩展标记语言, 查询语言, 数据流, 树型结构, 增量维护算法

Abstract: To decrease reconstruction cost of EXtensible Markup Language(XML)query evaluator data, an XML Query incremental Maintenance algorithm based on Tree Structure (XQMTS) was proposed. This algorithm used the XML tree structure to incrementally maintain the continuous query evaluator over XML data stream, and used the automata to express the state conversion. XQMTS algorithm could dynamically maintain the XML tree structure, at the same time avoided the annular structure operation in the absence of a Document Type Definition (DTD) and decreased the time of maintenance and the number of the transitions of state. Experiments results showed that XQMTS algorithm could effectively maintain the evaluator of the continuous query over XML data stream at a low cost of extra transitions of paths, and decreased the time of incremental maintenance and the number of state transitions.

Key words: extensible markup language, query languages, data stream, tree structure, incremental maintenance algorithm

中图分类号: