DBScholar

Back to papers

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)

Paper ID
6900
Venue
SIGMOD
Year
2024
Pagerank
5.3081996e-05
Overall Rank
9,176 | 37.05%
DOI
10.1145/3639284

Incoming Non-self Citations Over Time

Authors

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.

Previous Page 1 / 1 Next

Semantically Similar Papers