Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems

Zhang, Yuejia; Zheng, Weiguo; Zhang, Zhijie; Peng, Peng; Zhang, Xuecang

doi:10.1109/icde53745.2022.00082

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article2

Book1

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Two Birds One Stone: Dual-Role Path Based Subgraph Matching Using Partial Evaluation

Li,

Wang,

Yin

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Two Birds One Stone: Dual-Role Path Based Subgraph Matching Using Partial Evaluation

Li,

Wang,

Yin

et al. 2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

IVE: Accelerating Enumeration-Based Subgraph Matching via Exploring Isolated Vertices

Jiang,

Zhang,

Hou

et al. 2024

2024 IEEE 40th International Conference on Data Engineering (ICDE)

View full text Add to dashboard Cite

A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction

Zhang,

Lu,

Zheng

et al. 2024

Proc. ACM Manag. Data

View full text Add to dashboard Cite

Subgraph matching is a fundamental problem in graph analysis. In recent years, many subgraph matching algorithms have been proposed, making it pressing and challenging to compare their performance and identify their strengths and weaknesses. We observe that (1) The embedding enumeration in the classic filtering-ordering-enumerating framework dominates the overall performance, and thus enhancing the backtracking paradigm is becoming a current research trend; (2) Simply changing the limitation of output size results in a substantial variation in the ranking of different methods, leading to biased performance evaluation; (3) The techniques employed at different stages of subgraph matching interact with each other, making it less feasible to replace and evaluate a single technique in isolation. Therefore, a comprehensive survey and experimental study of subgraph matching is necessary to identify the current trends, ensure unbiasedness, and investigate the potential interactions. In this paper, we comprehensively review the methods in the current trend and experimentally confirm their advantage over prior approaches. We unbiasedly evaluate the performance of these algorithms by using an effective metric, namely embeddings per second. To fully investigate the interactions between various techniques, we select 10 representative techniques for each stage and evaluate all the feasible combinations.

show abstract

Hybrid Subgraph Matching Framework Powered by Sketch Tree for Distributed Systems

Cited by 4 publications

References 37 publications

Two Birds One Stone: Dual-Role Path Based Subgraph Matching Using Partial Evaluation

Two Birds One Stone: Dual-Role Path Based Subgraph Matching Using Partial Evaluation

IVE: Accelerating Enumeration-Based Subgraph Matching via Exploring Isolated Vertices

A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction

Contact Info

Product

Resources

About