强模拟在带权有向图的扩展及其匹配结果的排序  

Extension of Strong Simulation into Weighted Directed Graphs for Ranking Matches

作　　者：沈嘉思[1] 

机构地区：[1]北京大学信息科学技术学院

出　　处：《现代电信科技》2012年第9期53-57,共5页Modern Science & Technology of Telecommunications

摘　　要：图模式匹配是互联网海量数据库应用的关键技术。强模拟是现在一种实际应用效果较好的图模式匹配模型,但它无法对匹配结果按照重要程度排序。本文将强模拟推广到了带权有向图中,使用边的权值衡量和比较不同匹配子图或子图内部不同顶点的重要性,对匹配结果进行排序。Graph pattern matching is one of the key technologies used in applications of Internet massive database. Strong simulation is a graph pattern matching scheme that has relatively good practical results, but it has not yet resolved the problem of ranking matched results in accordance with the importance. This article promotes a solution by extending strong simulation into weighted directed graphs. The edge values are used to measure and compare the importance of different matched subgraphs or of different nodes within each matched subgraph.

关 键 词：图模式匹配 强模拟 排序 带权有向图 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]