| XML数据流中的后兄弟查询算法 |
| |
| 引用本文： | 汪万根.XML数据流中的后兄弟查询算法[J].计算机工程,2009,35(8):107-109. |
| |
| 作者姓名： | 汪万根 |
| |
| 作者单位： | 江西师范大学数学与信息科学学院,南昌,330022 |
| |
| 基金项目： | 江西师范大学青年成长基金 |
| |
| 摘 要： | 针对在XML文档树模型中进行后兄弟节点查询时内存消耗大、匹配效率低等缺陷,提出一种基于XML数据流与栈的后兄弟查询算法。采用SAX解析器与结构连接方法,对XML文档中所有已知节点与后兄弟节点进行精确匹配并输出。结果表明,该算法具有适用范围广、占用系统资源少、匹配效率高等优势。
|
| 关 键 词： | SAX解析器 XML数据流 后兄弟 |
| 修稿时间： | |
Algorithm for Querying Following-sibling on XML Data Stream |
| |
| WANG Wan-gen.Algorithm for Querying Following-sibling on XML Data Stream[J].Computer Engineering,2009,35(8):107-109. |
| |
| Authors: | WANG Wan-gen |
| |
| Affiliation: | School of Mathematics & Information Science;Jiangxi Normal University;Nanchang 330022 |
| |
| Abstract: | There are some disadvantages, consuming a large amount of memories, matching with low efficiency, to query following-sibling nodes in XML document tree model. This paper provides an algorithm based on XML data stream and stack for querying following-sibling. The algorithm uses Simple API for XML(SAX) parser and structural join, matches and outputs all following-sibling nodes of the given nodes. Results show that the algorithm has the advantage of wide applicability, low system resource occupancy and high ef... |
| |
| Keywords: | Simple API for XML(SAX) parser XML data stream following-sibling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
