| 一种处理图数据库中超图集合的查询方法 |
| |
| 引用本文： | 李兴东,姜守旭,张硕.一种处理图数据库中超图集合的查询方法[J].计算机科学与探索,2010,4(11):1005-1009. |
| |
| 作者姓名： | 李兴东 姜守旭 张硕 |
| |
| 作者单位： | 哈尔滨工业大学,计算机学院,哈尔滨,150001 |
| |
| 基金项目： | 60773063，the Key Program of the National Natural Science Foundation of China under Grant No.60933001，the National Basic Research Program of China under Grant No.2006CB303000(国家重点基础研究计划，the National High-Tech Research and Development Plan of China under Grant No.2009AA01Z149(国家高技术研究发展计划，the National Postdoctor Foundation of China under Grant No.20090450126，the Development Program for Outstanding Young Teachers in Harbin Institute of Technology under Grant No.HITQNJS.2009.052 |
| |
| 摘 要： | 针对图数据库中超图集合查询问题给出有效解决方案,算法采用过滤-验证框架机制,过滤器是基于特征的索引树。给出从数据库中快速提取特征的算法以及索引建立方法。将特征组织在一棵树中,使得过滤阶段两个特征的公共诱导子图只与查询图做一次子图同构测试。在验证阶段,将Ullman算法与极大团查找算法相结合进行子图同构检测。
|
| 关 键 词： | 超图集合查询 特征 索引 |
| 修稿时间： | |
An Approach for Processing Supergraph Set Query in Graph Database |
| |
| LI Xingdong,JIANG Shouxu,ZHANG Shuo.An Approach for Processing Supergraph Set Query in Graph Database[J].Journal of Frontier of Computer Science and Technology,2010,4(11):1005-1009. |
| |
| Authors: | LI Xingdong JIANG Shouxu ZHANG Shuo |
| |
| Affiliation: | Computer School, Harbin Institute of Technology, Harbin 150001, China |
| |
| Abstract: | This paper proposes an approach for processing supergraph set query in graph database, filtering- verification schema is selected in the algorithm, the filter is an index tree based on features mined from databsae. Fast algorithm for extracting features from databases is provided, it also gives method for constructing index. Organizing features in a tree make that the common induced subgraph of two or more features can be isomorphicly mapped into query only once. In verification phase, Ullman algorithm together with finding maximum cliuqe algorithm processes subgraph isomorphism test. |
| |
| Keywords: | supergraph set query feature index |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学与探索》浏览原始摘要信息 |
|
点击此处可从《计算机科学与探索》下载全文 |
|
