Incremental Sliding Window Connectivity over Streaming Graphs
Summary: BIC: a bidirectional incremental index that avoids physical edge deletions by maintaining forward and backward incremental computations over the stream timeline. Merging these views yields compact updates and fast sliding-window connectivity queries, with ~14x throughput and up to 3900x P95 latency improvements over prior indexes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Chao Zhang
- 2. Angela Bonifati
- 3. M. Tamer Özsu
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,641 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD | 4.3109001e-05 |
| 10,135 | ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks | 2026 | SIGMOD | 4.1945683e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 288 | Storm @Twitter | 2014 | SIGMOD | 0.00028939871 |
| 314 | MillWheel: Fault-Tolerant Stream Processing at Internet Scale | 2013 | VLDB | 0.00028084774 |
| 331 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00027214222 |
| 824 | Twitter Heron: Stream Processing at Scale | 2015 | SIGMOD | 0.0001623129 |
| 2,826 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.056119e-05 |
| 3,146 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.477231e-05 |
| 3,668 | The LDBC Social Network Benchmark: Business Intelligence Workload | 2023 | VLDB | 6.8591612e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,394 | Incremental Graph Computations: Doable and Undoable | 2017 | SIGMOD | 7.1480446e-05 |
| 6,476 | Parallel Index-based Stream Join on a Multicore CPU | 2020 | SIGMOD | 5.0496617e-05 |
| 3,063 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6321424e-05 |
| 9,730 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB | 4.2942813e-05 |
| 10,232 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.1945683e-05 |
| 11,042 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1945683e-05 |
| 3,854 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6988744e-05 |
| 7,576 | Querying Structural Diversity in Streaming Graphs | 2024 | VLDB | 4.7064285e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 4,970 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.7945079e-05 |