Back to papers
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification
Summary: BICE compresses the subgraph-search space by combining bipartite-matching pruning, failing-sets augmented with bipartite matching, and a novel cell-wide verification to avoid unnecessary candidate expansions. Combined algorithm yields up to ~100× speedups versus state-of-the-art baselines.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13070
- Venue
- VLDB
- Year
- 2023
- Pagerank
- 4.8326259e-05
- Overall Rank
- 7,100 | 50.61%
- DOI
-
10.14778/3598581.3598591
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 8,031 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.6018906e-05 |
| 9,934 |
MAVIS: Materialized View for Subgraph Matching |
2026 |
SIGMOD |
4.2496728e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,708 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,848 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
4.1945683e-05 |
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 |
| 203 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034889335 |
| 331 |
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing |
2018 |
VLDB |
0.00027214222 |
| 342 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026795977 |
| 461 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022499343 |
| 506 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021475362 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 900 |
Graph Indexing: Tree + Delta >= Graph |
2007 |
VLDB |
0.00015495155 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,635 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.0001105793 |
| 1,756 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.00010664542 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 2,007 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.8081235e-05 |
| 2,912 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9130459e-05 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,720 |
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques |
2010 |
VLDB |
6.8192237e-05 |
| 4,072 |
Performance and Scalability of Indexed Subgraph Query Processing Methods |
2015 |
VLDB |
6.4727847e-05 |
| 5,877 |
Taming Subgraph Isomorphism for RDF Query Processing |
2015 |
VLDB |
5.2916612e-05 |
| 11,598 |
IDAR: Fast Supergraph Search Using DAG Integration |
2020 |
VLDB |
4.1945683e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 8,031 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.6018906e-05 |
| 8,897 |
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs |
2025 |
SIGMOD |
4.427232e-05 |
| 10,708 |
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences |
2025 |
VLDB |
4.1945683e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 10,014 |
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching |
2026 |
SIGMOD |
4.1945683e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |