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.5650165e-05
Overall Rank
4,512 | 69.68%
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 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
4,077 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8156109e-05
5,880 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9584658e-05
6,966 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6301341e-05
7,535 Fast Local Subgraph Counting 2024 VLDB 5.4983904e-05
9,368 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1843659e-05
9,804 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1233734e-05
10,067 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0851868e-05
10,259 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.0480912e-05
10,260 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.0480912e-05
10,264 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.0480912e-05
10,432 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9769913e-05
10,620 SG-Serve: Efficient Model Serving for Subgraph-based Graph Representation Learning 2026 SIGMOD 4.9769913e-05
10,744 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9769913e-05
10,750 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9769913e-05
10,756 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9769913e-05
10,798 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9769913e-05
10,998 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9769913e-05
11,212 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9769913e-05
11,541 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 4.9769913e-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.00026688651
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023499655
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020116134
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018278591
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
713 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014571507
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,046 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012316579
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012007739
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011622165
1,252 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011334813
1,507 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010447258
1,901 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4014537e-05
2,022 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1686153e-05
2,168 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9292584e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4138334e-05
2,469 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.412568e-05
2,519 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.3494241e-05
3,400 High-Performance Dynamic Pattern Matching over Disordered Streams 2010 VLDB 7.330164e-05
4,124 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7895411e-05
5,409 High Performance Distributed OLAP on Property Graphs with Grasper 2020 SIGMOD 6.1424085e-05
Previous Page 1 / 1 Next

Semantically Similar Papers