| 图结构XML文档上子图查询的高效处理算法 |
| |
| 引用本文： | 王宏志,骆吉洲,李建中.图结构XML文档上子图查询的高效处理算法[J].软件学报,2009,20(9):2436-2449. |
| |
| 作者姓名： | 王宏志 骆吉洲 李建中 |
| |
| 作者单位： | 哈尔滨工业大学,计算机科学与技术学院,黑龙江,哈尔滨,150001 |
| |
| 基金项目： | 60703012，the National Basic Research Program of China under Grant No.2006CB303000 (国家重点基础研究发展计划 |
| |
| 摘 要： | 研究了图结构XML数据上子图查询处理,给出了一系列高效的处理算法.基于可达编码,首先提出基于哈希的结构连接算法(HGJoin)来处理图结构XML数据上的可达查询.然后,该算法被扩展来处理特殊的二分图查询.基于这些算法和所给出的代价模型,提出了一般DAG子图查询的处理算法和查询优化策略.这些算法经过简单修改即可有效地处理一般的子图查询.理论分析和实验结果表明,算法具有较高的效率.
|
| 关 键 词： | 图 子图查询 查询处理 |
| 收稿时间： | 2007/12/13 0:00:00 |
| 修稿时间： | 7/9/2008 12:00:00 AM |
Efficient Subgraph Query Processing Algorithms on Graph-Structured XML Documents |
| |
| WANG Hong-Zhi,LUO Ji-Zhou and LI Jian-Zhong.Efficient Subgraph Query Processing Algorithms on Graph-Structured XML Documents[J].Journal of Software,2009,20(9):2436-2449. |
| |
| Authors: | WANG Hong-Zhi LUO Ji-Zhou and LI Jian-Zhong |
| |
| Abstract: | Many challenges arise in subgraph query processing of graph-structured XML data. This paper studies the subgraph query processing of graph-structured XML data and proposes. A hash-based structural join algorithm, HGJoin to handle reachability queries on graph-structured XML data. Then, the algorithm is extended to process subgraph queries in form of bipartite graphs. Finally, based on these algorithms and cost model presented in this paper, a method to process subgraph queries in form of general DAGs is proposed. It is notable that all the algorithms above can be slightly modified to process subgraph queries in form of general graphs. Analysis and experiments show that all the algorithms have high performance. |
| |
| Keywords: | XML |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
