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 (Fudan University)
- 2. Weiguo Zheng (Fudan University)
- 3. Xiang Lian (Kent State University)
- 4. Yuzheng Cai (Fudan University)
- 5. X. Sean. Wang (Fudan University)
BibTeX Citation
@inproceedings{yang_sigmod24,
title = {{HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs}},
author = {Yang, Boyu and Zheng, Weiguo and Lian, Xiang and Cai, Yuzheng and Wang, X. Sean.},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3639284},
url = {https://dl.acm.org/doi/10.1145/3639284},
year = {2024}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,154 | Revisiting the Design of In-Memory Dynamic Graph Storage | 2025 | SIGMOD | 5.4769071e-05 |
| 9,624 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB | 5.2434488e-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 |
|---|---|---|---|---|
| 211 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00024797217 |
| 262 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00023084332 |
| 273 | Online Search of Overlapping Communities | 2013 | SIGMOD | 0.00022671795 |
| 1,036 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00012499878 |
| 2,112 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.1514258e-05 |
| 2,245 | Fast Set Intersection in Memory | 2011 | VLDB | 8.8734284e-05 |
| 3,212 | Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions | 2015 | VLDB | 7.6328776e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB |
| 2 | 3,724 | Overlap Set Similarity Joins with Theoretical Guarantees | 2018 | SIGMOD |
| 3 | 5,610 | Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints | 2021 | SIGMOD |
| 4 | 594 | Massive Graph Triangulation | 2013 | SIGMOD |
| 5 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 6 | 1,812 | Efficient SimRank-based Similarity Join Over Large Graphs | 2013 | VLDB |
| 7 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 8 | 3,212 | Faster Set Intersection with SIMD instructions by Reducing Branch Mispredictions | 2015 | VLDB |
| 9 | 3,474 | An Efficient Partition Based Method for Exact Set Similarity Joins | 2016 | VLDB |
| 10 | 2,112 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD |