首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种基于流的XML查询算法设计与实现
引用本文:牛纪桢,徐哲.一种基于流的XML查询算法设计与实现[J].大连理工大学学报,2005,45(5):745-748.
作者姓名:牛纪桢  徐哲
作者单位:大连理工大学,计算机科学与工程系,辽宁,大连,116024;大连理工大学,计算机科学与工程系,辽宁,大连,116024
摘    要:针对密集型数据查询要消耗大量内存的缺陷,设计了一种基于流的XM L文档查询算法.该算法在对XM L流的一次单向读取过程中处理XPath,接收查询表达式,将表达式转换为树形自动机,自动机以流的方式接收并处理XM L文档,同时输出当前处理结果.在查询树状态转换过程中附加了缓存操作,用于保存XM L流中暂时无法判断的文档片段.算法测试表明其占用内存空间基本恒定,不会随被查询文档的增大而增加.

关 键 词:XML流  XPath  自动机  查询
文章编号:1000-8608(2005)05-0745-04
收稿时间:2004-08-11
修稿时间:2004-08-112005-09-03

Design and implementation of a stream-based XML query processing algorithm
NIU Ji-zhen,XU Zhe.Design and implementation of a stream-based XML query processing algorithm[J].Journal of Dalian University of Technology,2005,45(5):745-748.
Authors:NIU Ji-zhen  XU Zhe
Institution:Dept. of Comput. Sci. and Eng., Dalian Univ. of Technol., Dalian 116024, China
Abstract:A large amount of memories are consumed during dense data querying.A query processing algorithm based on XML stream is designed.In one-pass scan of XML,this algorithm can process XPath query,receive query expressions and convert query expressions into automata.Automata receive and process XML documents in form of stream,then output the result.In the conversion of querying-tree,the buffer is added to save the document segment that temporarily cannot be identified in XML stream.Experimental results indicate the memory space occupied is almost constant and does not increase with the increase of the query document.
Keywords:XPath
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号