Novel Contrasting Sub-graph Index Algorithm
Huang Chong-ben · Jisuanji gongcheng · 2009
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.