DBScholar

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
hee64e7fd2d998db4
Venue
SIGMOD
Year
2023
Pagerank
6.6213567e-05
Overall Rank
4,370 | 70.71%
DOI
10.1145/3588692

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{jin_sigmod23,
        title = {{Circinus: Fast Redundancy-Reduced Subgraph Matching}},
        author = {Jin, Tatiana and Li, Boyang and Li, Yichao and Zhou, Qihui and Ma, Qianli and Zhao, Yunjian and Chen, Hongzhi and Cheng, James},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588692},
        url = {https://dl.acm.org/doi/10.1145/3588692},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 20 of 20 citing papers.

Rank Citing Paper Year Venue Pagerank
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
5,895 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9387634e-05
6,711 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6854796e-05
7,552 Fast Local Subgraph Counting 2024 VLDB 5.4802093e-05
8,899 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2401722e-05
9,837 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1064323e-05
9,881 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.1043481e-05
9,882 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.1043481e-05
10,101 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.068372e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,379 Algebraic Subgraph Counting 2027 SIGMOD 4.9605343e-05
10,498 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9605343e-05
10,681 SG-Serve: Efficient Model Serving for Subgraph-based Graph Representation Learning 2026 SIGMOD 4.9605343e-05
10,805 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9605343e-05
10,811 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9605343e-05
10,817 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9605343e-05
10,859 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9605343e-05
11,059 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9605343e-05
11,270 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9605343e-05
11,590 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

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
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026634326
235 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023701614
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,049 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012293903
1,090 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012062682
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,253 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011316982
1,502 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010431532
1,907 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.379165e-05
2,023 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1568397e-05
2,128 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9879343e-05
2,478 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3890338e-05
2,480 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.387452e-05
2,528 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.3237453e-05
3,410 High-Performance Dynamic Pattern Matching over Disordered Streams 2010 VLDB 7.3075605e-05
4,133 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7738028e-05
5,407 High Performance Distributed OLAP on Property Graphs with Grasper 2020 SIGMOD 6.132533e-05
Previous Page 1 / 1 Next

Semantically Similar Papers