Neural Similarity Search on Supergraph Containment (Extended Abstract)

May 13, 2024·
Hanchen Wang
Jianke Yu
Jianke Yu
,
Xiaoyang Wang
,
Chen Chen
,
Wenjie Zhang
,
Xuemin Lin
· 2 min read
CCF-A
Abstract
Supergraph search is a fundamental graph query processing problem. Supergraph search aims to find all data graphs contained in a given query graph based on the subgraph isomorphism. In other words, the goal is to determine if part of the query graph is the same as a smaller data graph. Existing algorithms construct the indices and adopt the filtering-and-verification framework, which is usually computationally expensive and can cause redundant computations. Recently, various learning-based methods have been proposed for a good trade-off between accuracy and efficiency for query processing tasks. However, to our knowledge, no learning-based method is proposed for the supergraph search task. In this paper, we propose the first learning-based method for similarity search on supergraph containment, named Neural Supergraph similarity Search (NSS). NSS first learns the representations for query and data graphs and then efficiently conducts the supergraph search on the representation space, the complexity of which is linear to the number of data graphs. The carefully designed Wasserstein discriminator and reconstruction network enable NSS to capture better the interrelation, structural and label information between and within the query and data graphs. Experiments demonstrate that the NSS is up to 6 orders of magnitude faster than the state-of-the-art exact supergraph search algorithm in query processing and is more accurate than the other learning-based solutions.
Type
Publication
IEEE International Conference on Data Engineering
Status
Peer-reviewed
Awards
CCF-A
IEEE International Conference on Data Engineering · 2024
publications

IEEE International Conference on Data Engineering, 2024

Supergraph search is a fundamental graph query processing problem. Supergraph search aims to find all data graphs contained in a given query graph based on the subgraph isomorphism. In other words, the goal is to determine if part of the query graph is the same as a smaller data graph. Existing algorithms construct the indices and adopt the filtering-and-verification framework, which is usually computationally expensive and can cause redundant computations. Recently, various learning-based methods have been proposed for a good trade-off between accuracy and efficiency for query processing tasks. However, to our knowledge, no learning-based method is proposed for the supergraph search task. In this paper, we propose the first learning-based method for similarity search on supergraph containment, named Neural Supergraph similarity Search (NSS). NSS first learns the representations for query and data graphs and then efficiently conducts the supergraph search on the representation space, the complexity of which is linear to the number of data graphs. The carefully designed Wasserstein discriminator and reconstruction network enable NSS to capture better the interrelation, structural and label information between and within the query and data graphs. Experiments demonstrate that the NSS is up to 6 orders of magnitude faster than the state-of-the-art exact supergraph search algorithm in query processing and is more accurate than the other learning-based solutions.

Jianke Yu
Authors
Jianke Yu (he/him)
PhD (2026) in Graph Machine Learning & Databases
I completed my PhD at the University of Technology Sydney (UTS) in 2026, supervised by Prof. Ying Zhang, A/Prof. Lu Qin and Dr Hanchen Wang. My research develops machine learning algorithms for graph-structured data and database systems — graph neural network architectures, and learning-based methods that improve database and data-mining algorithms (fraud detection, graph similarity, supergraph search, malware detection). My work has appeared in KDD and IEEE TKDE. I am joining Zhejiang Gongshang University as a faculty member in 2027.