Back to papers
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences
Summary: FiPE: eliminates redundant subgraph‑matching work by defining fine‑grained equivalences at vertex‑pair and multi‑vertex pattern granularity, clustering candidate pairs with isomorphic neighbor structure to prune across query vertices. Adds group‑equivalence deferral, matching‑order generation and conflict‑resolution to exploit those equivalences, yielding 2–3 orders of magnitude EPS speedup on real graphs.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 14010
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,715 | 25.54%
- DOI
-
10.14778/3749646.3749662
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 27 of 27 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 327 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027312381 |
| 341 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026850764 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 587 |
Scalable SPARQL Querying of Large RDF Graphs |
2011 |
VLDB |
0.00019623493 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,641 |
Truss-based Community Search over Large Directed Graphs |
2020 |
SIGMOD |
0.00011044805 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,746 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.0001069135 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,402 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.87387e-05 |
| 2,561 |
TripleBit: a Fast and Compact System for Large Scale RDF Data |
2013 |
VLDB |
8.5415562e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 5,502 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.4730826e-05 |
| 5,871 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2912806e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 6,283 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.1234789e-05 |
| 7,091 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
4.8304411e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 6,086 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2157921e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1905499e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 10,276 |
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs |
2026 |
VLDB |
4.1905499e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |