Accelerating Core Decomposition in Billion-Scale Hypergraphs
Summary: Efficient k-core decomposition for billion-scale hypergraphs. Introduces novel core-value computation and redundancy-elimination to reduce memory 36x and deliver 7x speedup, enabling single-thread processing of billion-edge hypergraphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Wenqian Zhang (University of New South Wales)
- 2. Zhengyi Yang (University of New South Wales)
- 3. Dong Wen (University of New South Wales)
- 4. Wentao Li (Hong Kong University of Science and Technology; University of Leicester)
- 5. Wenjie Zhang (University of New South Wales)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@inproceedings{zhang_sigmod25,
title = {{Accelerating Core Decomposition in Billion-Scale Hypergraphs}},
author = {Zhang, Wenqian and Yang, Zhengyi and Wen, Dong and Li, Wentao and Zhang, Wenjie and Lin, Xuemin},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709656},
url = {https://dl.acm.org/doi/10.1145/3709656},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,562 | Nucleus Decomposition Revisited: An Efficient Counting-Based Approach | 2026 | SIGMOD | 4.9605343e-05 |
| 11,126 | Efficient Temporal Edge-Core Maintenance in Streaming Graphs | 2026 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022377798 |
| 580 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00016057466 |
| 732 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014341313 |
| 829 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013587885 |
| 3,170 | On Querying Historical K-Cores | 2021 | VLDB | 7.5572564e-05 |
| 4,333 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB | 6.6444874e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,378 | Efficient and Effective Attributed Hypergraph Clustering via K-Nearest Neighbor Augmentation | 2023 | SIGMOD |
| 2 | 10,945 | Resource-Efficient FirmCore Decomposition on Billion-scale Multilayer Graphs | 2026 | VLDB |
| 3 | 5,725 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB |
| 4 | 8,095 | Parallel k-Core Decomposition: Theory and Practice | 2025 | SIGMOD |
| 5 | 11,504 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |
| 6 | 8,444 | Truss Decomposition in Hypergraphs | 2025 | VLDB |
| 7 | 732 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 8 | 2,873 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 9 | 10,877 | Efficient Hyper-truss Decomposition over Hypergraphs | 2026 | VLDB |
| 10 | 4,333 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB |