Back to papers
Subgraph Matching over Graph Federation
Summary: Graph federation across heterogeneous sources; FedGraph enables subgraph matching via decomp. and distributed joining. NP-hard; uses phase-wise approximation algorithms; benchmarks show 37.3x speedup and 61.8x less communication than state-of-the-art.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 12921
- Venue
- VLDB
- Year
- 2022
- Pagerank
- 5.2157921e-05
- Overall Rank
- 6,086 | 57.71%
- DOI
-
10.14778/3494124.3494129
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 20 of 20 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 4 |
Pregel: A System for Large-Scale Graph Processing |
2010 |
SIGMOD |
0.0019040811 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 616 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00019068362 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 811 |
Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization |
1991 |
SIGMOD |
0.00016385568 |
| 936 |
Data Lake Management: Challenges and Opportunities |
2019 |
VLDB |
0.00015197838 |
| 1,068 |
Probase: A Probabilistic Taxonomy for Text Understanding |
2012 |
SIGMOD |
0.00014316508 |
| 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 |
| 1,670 |
Speedup Graph Processing by Graph Ordering |
2016 |
SIGMOD |
0.00010944596 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,458 |
Multi-dimensional Resource Scheduling for Parallel Queries |
1996 |
SIGMOD |
8.7601979e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 8,405 |
Ontology-based Entity Matching in Attributed Graphs |
2019 |
VLDB |
4.516252e-05 |
| 9,577 |
Querying Shared Data with Security Heterogeneity |
2020 |
SIGMOD |
4.3206631e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1905499e-05 |
| 8,736 |
Historical Embedding-Guided Efficient Large-Scale Federated Graph Learning |
2024 |
SIGMOD |
4.4520434e-05 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 11,574 |
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query |
2020 |
SIGMOD |
4.1905499e-05 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1905499e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |