欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对不确定W eb社会网络的Top-k子图查询问题,以无向、顶点带标签及边赋权重的简单图为基本模型,设计了用来简洁描述社会网络并编码原始图信息的摘要图,提出了Top-k子图同构查询算法。针对真实和虚拟网络数据进行了大量实验,结果表明：基于摘要图的Top-k子图查询算法较VF2算法运算时间缩短;由于构建摘要图时的主要依据是顶点的标号,因此查询图的标号分布对查询性能有较大影响;顶点标号数目增加时该算法的查询性能呈类似指数形式提高,而VF2算法的查询性能没有受到较大影响;当数据图的顶点数量增大时,该算法与VF2算法相比,消耗时间的增长更缓慢;该算法在处理Top-k查询时体现出了稳定高效的性能。
英文摘要：
Aimed at the Top-k subgragh query problem for an uncertain Web social network,with the basic model of an undirected,vertex labeled and edge weighted simple graph,a summary graph is designed to represent social networks and encode the information of original graphs.The Top-k subgraph isomorphism query algorithm is proposed.Extensive experimental results from real and synthetic network data show： the operation time of the Top-k subgraph query algorithm based on summary graphs decreases compared with the VF2 algorithm;because the main foundation to construct a summary graph is the label of a vertex,the label distribution of a query graph has a great effect on the query performance;the query performance of the algorithm is improved by the index method with the increase of the vertex label number,but the query performance of the VF2 algorithm is not influenced;with the increase of the number of vertexes,compared with the VF2 algorithm,the increase of the time consumption of the algorithm is slow;the algorithm has stable and efficient performance on Top-k query.
同期刊论文项目
同项目期刊论文
期刊信息
位置：