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 (University of Waterloo)
- 2. Angela Bonifati (CNRS; Institut Universitaire de France; University Claude Bernard Lyon 1)
- 3. M. Tamer Özsu (University of Waterloo)
BibTeX Citation
@article{zhang_vldb24,
title = {{Incremental Sliding Window Connectivity over Streaming Graphs}},
author = {Zhang, Chao and Bonifati, Angela and Özsu, M. Tamer},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {10},
pages = {2473--2486},
doi = {10.14778/3675034.3675040},
url = {https://doi.org/10.14778/3675034.3675040},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,657 | An Experimental Comparison of Tree-data Structures for Connectivity Queries on Fully-dynamic Undirected Graphs | 2025 | SIGMOD | 5.3907647e-05 |
| 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,424 | ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks | 2026 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 220 | Storm @Twitter | 2014 | SIGMOD | 0.00024244587 |
| 224 | MillWheel: Fault-Tolerant Stream Processing at Internet Scale | 2013 | VLDB | 0.00024130894 |
| 264 | The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing | 2018 | VLDB | 0.00022980015 |
| 612 | Twitter Heron: Stream Processing at Scale | 2015 | SIGMOD | 0.0001573018 |
| 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.9437338e-05 |
| 3,018 | The LDBC Social Network Benchmark: Business Intelligence Workload | 2023 | VLDB | 7.8473755e-05 |
| 3,154 | Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs | 2022 | VLDB | 7.6959807e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,872 | TC-Match: Fast Time-constrained Continuous Subgraph Matching | 2024 | VLDB |
| 2 | 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |
| 3 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 4 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 5 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 6 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 7 | 6,937 | Querying Structural Diversity in Streaming Graphs | 2024 | VLDB |
| 8 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 9 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 10 | 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD |