GC: A Graph Caching System for Subgraph/Supergraph Queries
Summary: GC caches graph-query results to accelerate subgraph and supergraph queries, mitigating NP-complete isomorphism costs. It leverages both subgraph and supergraph cache hits beyond exact matches and ships developer and end-user dashboards for exploration. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jing Wang (Beihang University)
- 2. Zichen Liu (Chinese Academy of Sciences)
- 3. Shuai Ma (Beihang University)
- 4. Nikos Ntarmos (University of Glasgow)
- 5. Peter Triantafillou (University of Warwick)
BibTeX Citation
@article{wang_vldb18,
title = {{GC: A Graph Caching System for Subgraph/Supergraph Queries}},
author = {Wang, Jing and Liu, Zichen and Ma, Shuai and Ntarmos, Nikos and Triantafillou, Peter},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {12},
pages = {2022--2025},
doi = {10.14778/3229863.3236250},
url = {https://doi.org/10.14778/3229863.3236250},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,391 | CommunityAF: An Example-based Community Search Method via Autoregressive Flow | 2023 | VLDB | 5.626608e-05 |
| 11,852 | An Efficient Index for RDF Query Containment | 2019 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018398144 |
| 956 | Parallelizing Sequential Graph Computations | 2017 | SIGMOD | 0.0001297452 |
| 5,716 | Graph-Aware, Workload-Adaptive SPARQL Query Caching | 2015 | SIGMOD | 6.1100964e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,940 | G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching | 2020 | SIGMOD |
| 2 | 1,237 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD |
| 3 | 3,194 | GuP: Fast Subgraph Matching by Guard-based Pruning | 2023 | SIGMOD |
| 4 | 10,375 | GraphMatch: Subgraph Query Processing on Steroids | 2026 | SIGMOD |
| 5 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 6 | 1,774 | gStore: Answering SPARQL Queries via Subgraph Matching | 2011 | VLDB |
| 7 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 8 | 5,118 | Efficient Streaming Subgraph Isomorphism with Graph Neural Networks | 2021 | VLDB |
| 9 | 5,075 | CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor | 2024 | VLDB |
| 10 | 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |