An Edge-Based Framework for Fast Subgraph Matching in a Large Graph

被引:0
|
作者
Kim, Sangjae [1 ]
Song, Inchul [1 ]
Lee, Yoon Joon [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Comp Sci, Taejon, South Korea
关键词
ISOMORPHISM; ALGORITHM;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In subgraph matching, we want to find all subgraphs of a database graph that are isomorphic to a query graph. Subgraph matching requires subgraph isomorphism testing, which is NP-complete. Recently, some techniques specifically designed for subgraph matching in a large graph have been proposed. They are based on a filtering-and-verification framework. In the filtering phase, they filter out vertices that are not qualified for subgraph isomorphism testing. In the verification phase, subgraph isomorphism testing is performed and all matched subgraphs are returned to the user. We call them a vertex-based framework in the sense that they use vertex information when filtering out unqualified vertices. Edge information, however, can also be used for efficient subgraph matching. In this paper, we propose an edge-based framework for fast subgraph matching in a large graph. By using edge connectivity information, our framework not only filters out more vertices in the filtering phase, but also avoids unnecessary edge connectivity checking operations in the verification phase. The experimental results show that our method significantly outperforms existing approaches for subgraph matching in a large graph.
引用
收藏
页码:404 / 417
页数:14
相关论文
共 50 条
  • [1] FAST: A Scalable Subgraph Matching Framework over Large Graphs
    He, Jiezhong
    Liu, Zhouyang
    Chen, Yixin
    Pan, Hengyue
    Huang, Zhen
    Li, Dongsheng
    [J]. 2022 IEEE HIGH PERFORMANCE EXTREME COMPUTING VIRTUAL CONFERENCE (HPEC), 2022,
  • [2] Fast Subgraph Matching by Dynamic Graph Editing
    Jiang, Zite
    Zhang, Shuai
    Liu, Boxiao
    Hou, Xingzhong
    Yuan, Mengting
    You, Haihang
    [J]. IEEE Transactions on Services Computing, 2024, 17 (05): : 2432 - 2443
  • [3] Fast edge-based stereo matching approach for road applications
    Ilyas El Jaafari
    Mohamed El Ansari
    Lahcen Koutti
    [J]. Signal, Image and Video Processing, 2017, 11 : 267 - 274
  • [4] Fast edge-based stereo matching approach for road applications
    El Jaafari, Ilyas
    El Ansari, Mohamed
    Koutti, Lahcen
    [J]. SIGNAL IMAGE AND VIDEO PROCESSING, 2017, 11 (02) : 267 - 274
  • [5] Fast edge-based stereo matching algorithm based on search space reduction
    Moallem, P
    Faez, K
    [J]. NEURAL NETWORKS FOR SIGNAL PROCESSING XII, PROCEEDINGS, 2002, : 587 - 596
  • [6] A graph matching method and a graph matching distance based on subgraph assignments
    Raveaux, Romain
    Burie, Jean-Christophe
    Ogier, Jean-Marc
    [J]. PATTERN RECOGNITION LETTERS, 2010, 31 (05) : 394 - 406
  • [7] A subgraph matching algorithm based on subgraph index for knowledge graph
    Yunhao Sun
    Guanyu Li
    Jingjing Du
    Bo Ning
    Heng Chen
    [J]. Frontiers of Computer Science, 2022, 16
  • [8] A subgraph matching algorithm based on subgraph index for knowledge graph
    Yunhao SUN
    Guanyu LI
    Jingjing DU
    Bo NING
    Heng CHEN
    [J]. Frontiers of Computer Science., 2022, 16 (03) - 141
  • [9] A subgraph matching algorithm based on subgraph index for knowledge graph
    Sun, Yunhao
    Li, Guanyu
    Du, Jingjing
    Ning, Bo
    Chen, Heng
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2022, 16 (03)
  • [10] Subgraph Matching with Set Similarity in a Large Graph Database
    Hong, Liang
    Zou, Lei
    Lian, Xiang
    Yu, Philip S.
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (09) : 2507 - 2521