Graph Similarity Join with K-Hop Tree Indexing

• 作 者: Yue Wang Hongzhi Wang Chen Ye
• 机 构: HarbinInstituteofTechnology
• 出 处: 国际计算机前沿大会会议论文集
• 发表日期: 2015年1期
• 关键词: GRAPH SIMILARITY JOIN EDIT distance constraint k-hop tree based INDEXING structu
• 基金项目: This paper was partially supported by NGFR 973 grant 2012CB316200, NSFC grant 61472099 and National Sci-Tech Support Plan 2015BAH10F00.

Graph similarity join has become imperative for integrating noisy and inconsistent data from multiple data sources. The edit distance is commonly used to measure the similarity between graphs. To accelerate the similarity join based on graph edit distance