Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges
Summary: SWTC introduces a sliding-window approach for approximate triangle counting in streaming graphs with duplicate edges. Fixed-length slicing delivers unbiased sampling and memory-bounded cardinality estimation, with theoretical guarantees and improved accuracy versus baselines under the same memory. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Xiangyang Gou (Peking University)
- 2. Lei Zou (Peking University)
BibTeX Citation
@inproceedings{gou_sigmod21,
title = {{Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges}},
author = {Gou, Xiangyang and Zou, Lei},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3452800},
url = {https://dl.acm.org/doi/10.1145/3448016.3452800},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 458 | Counting Triangles in Data Streams | 2006 | PODS | 0.0001810876 |
| 594 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00015979077 |
| 927 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB | 0.00013161079 |
| 1,103 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.000121583 |
| 2,178 | Optimal Sampling From Distributed Streams | 2010 | PODS | 9.0159538e-05 |
| 2,576 | Optimal Sampling from Sliding Windows | 2009 | PODS | 8.3964437e-05 |
| 2,753 | Sampling Time-Based Sliding Windows in Bounded Space | 2008 | SIGMOD | 8.1647557e-05 |
| 3,393 | OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs | 2014 | SIGMOD | 7.45141e-05 |
| 4,500 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 6.6603827e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,997 | Efficient Bi-triangle Counting for Large Bipartite Networks | 2021 | VLDB |
| 2 | 6,363 | The Complexity of Counting Cycles in the Adjacency List Streaming Model | 2019 | PODS |
| 3 | 11,520 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS |
| 4 | 10,847 | GREAT: Generalized Reservoir Sampling based Triangle Counting Estimation over Streaming Graphs | 2025 | VLDB |
| 5 | 10,411 | Triangle Counting in Hypergraph Streams: A Complete and Practical Approach | 2026 | SIGMOD |
| 6 | 9,375 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 7 | 1,103 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB |
| 8 | 5,110 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS |
| 9 | 458 | Counting Triangles in Data Streams | 2006 | PODS |
| 10 | 4,500 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB |