HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs
Summary: HERO: hierarchical set-partitioning for graph set intersection, with a SIB-tree bitmap index; SIMD-agnostic and orthogonal to merge-based methods. Decomposes into bitmap-AND subtasks; NP-hardness proven; a heuristic tackles it with large speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Boyu Yang
- 2. Weiguo Zheng
- 3. Xiang Lian
- 4. Yuzheng Cai
- 5. X. Sean. Wang
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,267 | Revisiting the Design of In-Memory Dynamic Graph Storage | 2025 | SIGMOD | 4.545679e-05 |
| 10,688 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 110 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00047892924 |
| 342 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00026795977 |
| 370 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00025415479 |
| 1,500 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011674394 |
| 1,973 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.8913631e-05 |
| 2,464 | Fast Set Intersection in Memory | 2011 | VLDB | 8.7524354e-05 |
| 3,448 | Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions | 2015 | VLDB | 7.0844401e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,596 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 4,353 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD | 6.263585e-05 |
| 5,949 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD | 5.2595857e-05 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 10,871 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 2,117 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB | 9.5155578e-05 |
| 8,630 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 4.480887e-05 |
| 3,448 | Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions | 2015 | VLDB | 7.0844401e-05 |
| 4,050 | An Efficient Partition Based Method for Exact Set Similarity Joins | 2016 | VLDB | 6.4953612e-05 |
| 1,973 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.8913631e-05 |