Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing
Summary: Pensieve: skewness-aware multi-version graph storage for efficient version switching. Differentiated storage by vertex degree (copy for low-degree, delta for high-degree) and a last-root, time-locality switching scheme on Ligra reduce memory footprint and speed up access to recent versions vs state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tangwei Ying (Huazhong University of Science and Technology)
- 2. Hanhua Chen (Huazhong University of Science and Technology)
- 3. Hai Jin (Huazhong University of Science and Technology)
BibTeX Citation
@inproceedings{ying_sigmod20,
title = {{Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing}},
author = {Ying, Tangwei and Chen, Hanhua and Jin, Hai},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3380590},
url = {https://dl.acm.org/doi/10.1145/3318464.3380590},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,647 | Auxo: A Scalable and Efficient Graph Stream Summarization Structure | 2023 | VLDB | 5.3921304e-05 |
| 9,624 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB | 5.2434488e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 211 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00024797217 |
| 1,349 | Principles of Dataset Versioning: Exploring the Recreation/Storage Tradeoff | 2015 | VLDB | 0.00011069122 |
| 3,594 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 7.2736453e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,424 | Hybrid Pulling/Pushing for I/O-Efficient Distributed and Iterative Graph Computing | 2016 | SIGMOD |
| 2 | 5,612 | Cache-Efficient Fork-Processing Patterns on Large Graphs | 2021 | SIGMOD |
| 3 | 8,154 | Revisiting the Design of In-Memory Dynamic Graph Storage | 2025 | SIGMOD |
| 4 | 9,624 | RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries | 2025 | VLDB |
| 5 | 3,023 | Persistent Data Sketching | 2015 | SIGMOD |
| 6 | 7,897 | AeonG: An Efficient Built-in Temporal Support in Graph Databases | 2024 | VLDB |
| 7 | 3,778 | Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs | 2021 | SIGMOD |
| 8 | 9,218 | GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations | 2015 | VLDB |
| 9 | 6,456 | LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR | 2024 | SIGMOD |
| 10 | 10,207 | Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR | 2026 | SIGMOD |