| 基于2-hop优化的子图模式匹配算法 |
| |
| 引用本文： | 张航,王宏志,李建中,高宏.基于2-hop优化的子图模式匹配算法[J].黑龙江大学自然科学学报,2010,27(1). |
| |
| 作者姓名： | 张航 王宏志 李建中 高宏 |
| |
| 作者单位： | 哈尔滨工业大学计算机科学与技术学院,哈尔滨,150001 |
| |
| 基金项目： | 国家重点基础研究发展计划973项目，国家自然基金重点资助项目，国家自然科学基金资助项目，黑龙江省青年科技专项资金，国家863计划资助项目，NSFC/RGC联合科研基金 |
| |
| 摘 要： | 讨论大图上有效可达标记2-hop编码,及其构造的图结构信息数据结构在判定两点之间可达性的高效性,基于这些高效结构,提出一种基于栈的DAG全局图模式匹配算法,该算法结合了栈在匹配过程中线性空间开销的优势。实验结果表明,相对于目前主流的图模式匹配算法,该算法具有中间结果小,时间高效的优势。
|
| 关 键 词： | 子图查询 2-hop编码 整体图模式匹配 |
2-hop based for pattern matching algorithm on DAGS |
| |
| ZHANG Hang,WANG Hong-zhi,LI Jian-zhong,GAO Hong.2-hop based for pattern matching algorithm on DAGS[J].Journal of Natural Science of Heilongjiang University,2010,27(1). |
| |
| Authors: | ZHANG Hang WANG Hong-zhi LI Jian-zhong GAO Hong |
| |
| Abstract: | The high-performance reachability label 2-hop coding of large graph was discussed, as well as the time efficiency of 2-hop coding graph constructed structural information in the query reachability between two points.Based on these data stuction, presented a based stacks holistic twig pattern matching algorithm on, which combines advantages of linear space of the stacks. The test results showed that compared with the current matching algorithm,out algorithm outperforms well, which has a small intermediate results and time efficiency advantage. |
| |
| Keywords: | subgraph query label 2-hop holistic twig join |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
