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)
Incoming Non-self Citations Over Time
Authors
- 1. Tatiana Jin (Chinese University of Hong Kong; Kasma Pte Ltd.)
- 2. Boyang Li (Chinese University of Hong Kong)
- 3. Yichao Li (Chinese University of Hong Kong; Kasma Pte Ltd.)
- 4. Qihui Zhou (Chinese University of Hong Kong)
- 5. Qianli Ma (Chinese University of Hong Kong)
- 6. Yunjian Zhao (Chinese University of Hong Kong)
- 7. Hongzhi Chen (Kasma Pte Ltd.)
- 8. James Cheng (Chinese University of Hong Kong)
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 18 of 18 citing papers.
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,190 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 2 | 10,419 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 3 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 4 | 5,275 | RapidFlow: An Efficient Approach to Continuous Subgraph Matching | 2022 | VLDB |
| 5 | 2,187 | Subgraph Matching: on Compression and Computation | 2018 | VLDB |
| 6 | 7,150 | BSX : Subgraph Matching with Batch Backtracking Search | 2025 | SIGMOD |
| 7 | 4,983 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 8 | 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 9 | 5,758 | Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach | 2025 | SIGMOD |
| 10 | 4,995 | Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction | 2023 | SIGMOD |