作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (5): 64-67,9. doi: 10.3969/j.issn.1000-3428.2009.05.022

• 软件技术与数据库 • 上一篇    下一篇

一种新颖的对比子图索引算法

黄崇本1,陶剑文1,2   

  1. (1. 浙江工商职业技术学院计算机应用研究所,宁波 315012;2. 宁波大学信息科学与工程学院,宁波 315211)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-03-05 发布日期:2009-03-05

Novel Contrasting Sub-graph Index Algorithm

HUANG Chong-ben1, TAO Jian-wen1,2   

  1. (1. Institute of Computer Application Research, Zhejiang Business Technology Institute, Ningbo 315012; 2. College of Information Science and Engineering, Ningbo University, Ningbo 315211)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-03-05 Published:2009-03-05

摘要: 针对当前图索引算法存在的问题,提出一种基于对比子图索引框架,开发冗余感知机制,选择一个小型的具有明显区分力的索引特征集,改善索引性能。实验结果表明,该算法对不同的包容搜索载荷能达到近优化的修剪力,与传统图搜索方法相比,具有明显的索引性能优势。

关键词: 图搜索, 子图索引, 聚类, 对比特征

Abstract: In allusion to the problem of current graph indexing algorithm, this paper proposes a contrasting sub graph indexing model and developes a redundancy sensitive procedure to select a small discriminative indexing feature set, which improves the indexing performance. Experimental results on real test data show that this algorithm achieves near-optimal pruning power on various containment search workloads, and confirms its obvious advantage over indices built for traditional graph search in this new scenario.

Key words: graph search, sub-graph indexing, clustering, contrasting feature

中图分类号: