基于自动机的XML流多查询处理  

Automata-based Multiple Queries Handling over XML Streams

作　　者：张兵令[1] 

机构地区：[1]上海杉达学院教务处,上海201209

出　　处：《计算机工程》2008年第16期63-65,共3页Computer Engineering

摘　　要：XML流数据处理在研究领域引起广泛关注,该文针对XML流上的多查询处理提出一种算法,把多个查询合并为一个共享前缀的查询树,应用自动机和运行时栈相结合的方法,单遍扫描XML流处理数据流上的多个查询。该算法采用一种分层栈结构保存查询模式匹配候选集,利用XML节点的区间编码来确定节点之间的关系,返回整条匹配路径。The problem of processing streaming XML data is gaining widespread attention from the research community. This paper proposes a novel algorithm for handling of multiple queries over the XML streams. The approach merges the multiple queries into a single prefix sharing query tree, and combines the automata with the runtime stack structure to answer multiple XML path queries through scanning the XML stream at the same time. The algorithm returns the whole matching path by using a new hierarchical stack structure to store the result of query pattern matches, and confirms the relationship within the node through the position encodes in the XML data stream.

关 键 词：XML数据流 前缀共享 自动机 

分 类 号：TP311.5[自动化与计算机技术—计算机软件与理论]