XML流上的XQuery前缀共享查询

如何在XML流上高效地执行大量复杂XQuery查询是当今研究的热点之一。在数据选择分发等应用中，还希望在解析流的同时尽早地输出查询结果。为此，本文将XQuery查询的路径导航和结果构造两个阶段分别运行于服务器、客户机两端。导航阶段针对XQuery查询定义了扩展的基本XSIEQ机E-XSIEQ（Extended　XML　Stream　Quervwith　Immediate　Evaluation），它是一种被索引化、基于栈的自动机。在EXSIEQ机上设计应用了TreeBuf（TreeBuffer）算法，它是一种树型提升缓冲的查询算法，算法使用了前缀共享计算的技术，能高效处理XQuery查询，而且能优化XPath查询。实验证明了TreeBuf算法的高效性。

A Sharing Prefix XQuery Query Engine over XML Stream

Much research has been done in evaluating massive complicated XQuery set over an XML stream efficiently. In some applications especially data selecting and distributing,it is further required to output the results while parsing XML stream for higher system efficiency.An XQuery query process is divided into two stages:path navigation and re- sult construction and this two stages separately run at two sides of system that has the Client/Server model.In the for- mer stage,an extended XSIEQ machine E-XSIEQ(Extended XML Stream Query with Immediate Evaluation) is de- fined,which is a kind of indexed automata based on stack.Moreover,TreeBuf(Tree Buffer) algorithm based on pro- moting tree buffer is put forward.It uses XQuery's sharing prefix characteristic and can both process XQuery query efficiently and optimize XPath query.Experimental results show that TreeBuf algorithm's performance is considerable.