Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
Summary: Complete taxonomy of hyper-vertex triangles (inner, hybrid, outer) enabling unified hypergraph triangle counting in streams. HTCount (memory-adaptive reservoir sampling) and HTCount-P (partitioned reservoirs) provide unbiased estimators with variance bounds and 10–100× lower error under tight memory. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Lingkai Meng (Shanghai Jiao Tong University)
- 2. Long Yuan (Wuhan University)
- 3. Xuemin Lin (Shanghai Jiao Tong University)
- 4. Wenjie Zhang (University of New South Wales)
- 5. Ying Zhang (Zhejiang Gongshang University)
BibTeX Citation
@inproceedings{meng_sigmod26,
title = {{Triangle Counting in Hypergraph Streams: A Complete and Practical Approach}},
author = {Meng, Lingkai and Yuan, Long and Lin, Xuemin and Zhang, Wenjie and Zhang, Ying},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769837},
url = {https://dl.acm.org/doi/10.1145/3769837},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,328 | Truss-based Community Search over Large Directed Graphs | 2020 | SIGMOD | 0.00011140898 |
| 2,635 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 8.3200595e-05 |
| 5,598 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 6.1546212e-05 |
| 9,622 | Revisiting Graph Analytics Benchmark | 2025 | SIGMOD | 5.2434488e-05 |
| 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,375 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 2 | 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB |
| 3 | 4,613 | On Sampling from Massive Graph Streams | 2017 | VLDB |
| 4 | 1,103 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB |
| 5 | 10,847 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB |
| 6 | 5,110 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS |
| 7 | 2,635 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD |
| 8 | 4,500 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB |
| 9 | 458 | Counting Triangles in Data Streams | 2006 | PODS |
| 10 | 11,094 | Efficient Computation of Hyper-triangles on Hypergraphs | 2025 | VLDB |