Back to papers
Circinus: Fast Redundancy-Reduced Subgraph Matching
Summary: Circinus introduces compression-based backtracking to enable computation sharing and cut repeated work in Ullmann-style subgraph matching. Extensive experiments report orders-of-magnitude speedups on standard subgraph matching benchmarks.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6515
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.3507988e-05
- Overall Rank
- 5,728 | 60.16%
- DOI
-
10.1145/3588692
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 7,934 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.613363e-05 |
| 8,031 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.6018906e-05 |
| 9,730 |
TC-Match: Fast Time-constrained Continuous Subgraph Matching |
2024 |
VLDB |
4.2942813e-05 |
| 9,935 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2482599e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,096 |
NeuSO: Neural Optimizer for Subgraph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,292 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.1945683e-05 |
| 10,514 |
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,708 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,979 |
Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching |
2024 |
SIGMOD |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 203 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034889335 |
| 331 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027214222 |
| 461 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022499343 |
| 506 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021475362 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,756 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.00010664542 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 1,953 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9665955e-05 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 2,997 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.7559339e-05 |
| 3,009 |
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU |
2020 |
VLDB |
7.7214924e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,215 |
Fractal: A General-Purpose Graph Pattern Mining System |
2019 |
SIGMOD |
7.3645742e-05 |
| 3,641 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
6.8884895e-05 |
| 3,815 |
High-Performance Dynamic Pattern Matching over Disordered Streams |
2010 |
VLDB |
6.7333316e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,616 |
High Performance Distributed OLAP on Property Graphs with Grasper |
2020 |
SIGMOD |
5.409812e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 5,926 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.271318e-05 |
| 2,997 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.7559339e-05 |
| 8,031 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.6018906e-05 |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 9,935 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2482599e-05 |
| 6,575 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
5.0052259e-05 |