Space Efficient Mining of Multigraph Streams
Summary: Space-efficient streaming algorithms for multigraph degree analysis (frequency moments, heavy hitters, range sums) that correct multiplicity bias from repeated edges. Novel cascaded summaries—nesting sketches, sampling, hashing and distinct counting—yield provable sublinear space bounds and strong empirical accuracy. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 43 | Models and Issues in Data Stream Systems | 2002 | PODS | 0.00072723062 |
| 166 | Approximate Frequency Counts over Data Streams | 2002 | VLDB | 0.00039361552 |
| 308 | Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports | 2001 | VLDB | 0.00028142852 |
| 323 | Gigascope: A Stream Database for Network Applications | 2003 | SIGMOD | 0.00027492196 |
| 549 | Tracking Join and Self-Join Sizes in Limited Storage | 1999 | PODS | 0.00020376603 |
| 1,222 | Querying and Mining Data Streams: You Only Get One Look | 2002 | SIGMOD | 0.00013213129 |
| 3,050 | Comparing Data Streams Using Hamming Norms (How to Zero In) | 2002 | VLDB | 7.6512619e-05 |
| 3,102 | Processing Set Expressions over Continuous Update Streams | 2003 | SIGMOD | 7.5586568e-05 |
| 3,541 | STREAM: The Stanford Stream Data Manager (Demonstration Description) | 2003 | SIGMOD | 6.9935367e-05 |
| 5,038 | Data Stream Query Processing: A Tutorial | 2003 | VLDB | 5.7432219e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,108 | Space-Efficient Estimation of Statistics over Sub-Sampled Streams | 2012 | PODS | 4.1945683e-05 |
| 1,953 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB | 9.9665955e-05 |
| 7,031 | Vertex and Hyperedge Connectivity in Dynamic Graph Streams | 2015 | PODS | 4.8561505e-05 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 4,898 | On Sampling from Massive Graph Streams | 2017 | VLDB | 5.8459467e-05 |
| 11,321 | Approximately Counting Subgraphs in Data Streams | 2022 | PODS | 4.1945683e-05 |
| 644 | Densest Subgraph in Streaming and MapReduce | 2012 | VLDB | 0.00018748988 |
| 4,879 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8575676e-05 |
| 4,089 | On Dense Pattern Mining in Graph Streams [Extended Abstract] | 2010 | VLDB | 6.4587806e-05 |
| 2,607 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 8.4630211e-05 |