Back to papers
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching
Summary: BEE uses block-separator decomposition to cut redundancy in subgraph matching, enabling detection of global and partial redundancies beyond local pruning. It proves NP-hardness of optimizing the block-separator tree, and offers greedy decomposition plus a block-reference structure that deliver large EPS speedups over state-of-the-art.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7317
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 5.1725247e-05
- Overall Rank
- 10,014 | 30.41%
- DOI
-
10.1145/3749159
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 26 of 26 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 228 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00024154596 |
| 267 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00023020464 |
| 292 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.0002223786 |
| 487 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017695307 |
| 682 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015144404 |
| 1,031 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00012615956 |
| 1,053 |
Are We Ready For Learned Cardinality Estimation? |
2021 |
VLDB |
0.00012504851 |
| 1,097 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00012273511 |
| 1,155 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.00012006336 |
| 1,278 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00011462905 |
| 1,566 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
0.00010397786 |
| 2,094 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
9.2515997e-05 |
| 2,142 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
9.1646667e-05 |
| 2,201 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
9.0257706e-05 |
| 2,214 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
9.008953e-05 |
| 2,312 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.8466711e-05 |
| 2,533 |
Learned Cardinality Estimation: An In-depth Study |
2022 |
SIGMOD |
8.5233704e-05 |
| 2,789 |
TreeSpan: Efficiently Computing Similarity All-Matching |
2012 |
SIGMOD |
8.1864277e-05 |
| 2,879 |
G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching |
2020 |
SIGMOD |
8.0744978e-05 |
| 3,396 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
7.5176876e-05 |
| 4,186 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
6.9091925e-05 |
| 4,693 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
6.6231764e-05 |
| 5,248 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.3687097e-05 |
| 5,615 |
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction |
2023 |
SIGMOD |
6.2131411e-05 |
| 6,546 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
5.9031535e-05 |
| 6,698 |
Speeding Up End-to-end Query Execution via Learning-based Progressive Cardinality Estimation |
2023 |
SIGMOD |
5.8569921e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,855 |
Mix & Match: Subgraph Matching for Absolute Coverage |
2025 |
VLDB |
5.1725247e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
5.1725247e-05 |
| 1,097 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00012273511 |
| 6,546 |
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification |
2023 |
VLDB |
5.9031535e-05 |
| 2,312 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
8.8466711e-05 |
| 5,248 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
6.3687097e-05 |
| 10,715 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
5.1725247e-05 |
| 9,936 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
5.2356043e-05 |
| 682 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00015144404 |
| 7,038 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
5.7719407e-05 |