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)
Incoming Non-self Citations Over Time
Authors
- 1. Zhijie Zhang (Fudan University)
- 2. Weiguo Zheng (Fudan University)
BibTeX Citation
@inproceedings{zhang_sigmod26,
title = {{BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching}},
author = {Zhang, Zhijie and Zheng, Weiguo},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3749159},
url = {https://dl.acm.org/doi/10.1145/3749159},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,740 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 4.9793485e-05 |
| 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 27 of 27 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 | 10,734 | CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination | 2026 | VLDB |
| 2 | 1,100 | CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching | 2019 | SIGMOD |
| 3 | 6,504 | BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification | 2023 | VLDB |
| 4 | 10,519 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 5 | 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 6 | 4,075 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 7 | 10,258 | Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences | 2025 | VLDB |
| 8 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 9 | 5,880 | Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach | 2025 | SIGMOD |
| 10 | 6,965 | BSX : Subgraph Matching with Batch Backtracking Search | 2025 | SIGMOD |