Subgraph Matching: on Compression and Computation
Summary: Addresses subgraph matching’s overlooked output crisis: materializing all occurrences can dominate computation. VCBC compresses matches into equivalent codes, while CBF computes these codes directly and prunes intermediates, achieving up to 10^5 compression and substantial speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Miao Qiao (Massey University)
- 2. Hao Zhang (Chinese University of Hong Kong)
- 3. Hong Cheng (Chinese University of Hong Kong)
BibTeX Citation
@article{qiao_vldb18,
title = {{Subgraph Matching: on Compression and Computation}},
author = {Qiao, Miao and Zhang, Hao and Cheng, Hong},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {2},
pages = {176--188},
doi = {10.14778/3149193.3149198},
url = {https://doi.org/10.14778/3149193.3149198},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 30 of 30 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 2 | 9,030 | MatCo: Computing Match Cover of Subgraph Query over Graph Data | 2025 | SIGMOD |
| 3 | 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 4 | 9,361 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB |
| 5 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 6 | 1,100 | CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching | 2019 | SIGMOD |
| 7 | 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 8 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 9 | 10,254 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 10 | 4,075 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |