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
摘要: 针对当前图索引算法存在的问题,提出一种基于对比子图索引框架,开发冗余感知机制,选择一个小型的具有明显区分力的索引特征集,改善索引性能。实验结果表明,该算法对不同的包容搜索载荷能达到近优化的修剪力,与传统图搜索方法相比,具有明显的索引性能优势。
关键词:
图搜索,
子图索引,
聚类,
对比特征
CLC Number:
HUANG Chong-ben; TAO Jian-wen;. Novel Contrasting Sub-graph Index Algorithm[J]. Computer Engineering, 2009, 35(5): 64-67,9.
黄崇本;陶剑文;. 一种新颖的对比子图索引算法[J]. 计算机工程, 2009, 35(5): 64-67,9.