Auxo: A Scalable and Efficient Graph Stream Summarization Structure
Summary: Auxo's Prefix Embedded Tree (PET) embeds binary prefixes and binary-log search to summarize dynamic graph streams, lowering insert/query to O(log|E|) and reducing storage by ≈log|E|. A proportional-PET supports scalable growth with ≈80% memory utilization and 10–100× faster updates/queries vs. hash-matrix fingerprint sketches. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhiguo Jiang (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
@article{jiang_vldb23,
title = {{Auxo: A Scalable and Efficient Graph Stream Summarization Structure}},
author = {Jiang, Zhiguo and Chen, Hanhua and Jin, Hai},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {6},
pages = {1386--1398},
doi = {10.14778/3583140.3583154},
url = {https://doi.org/10.14778/3583140.3583154},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,566 | Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning | 2024 | SIGMOD | 5.8381749e-05 |
| 8,504 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.4132367e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD | 9.7380494e-05 |
| 2,148 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD | 9.0825156e-05 |
| 2,209 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.9437338e-05 |
| 2,635 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 8.3200595e-05 |
| 4,695 | Graph Synopses, Sketches, and Streams: A Survey | 2012 | VLDB | 6.5587201e-05 |
| 9,884 | Pensieve: Skewness-Aware Version Switching for Efficient Graph Processing | 2020 | SIGMOD | 5.2028745e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,360 | Efficient External-Memory Bisimulation on DAGs | 2012 | SIGMOD |
| 2 | 4,953 | Efficient Graph Summarization using Weighted LSH at Billion-Scale | 2021 | SIGMOD |
| 3 | 3,470 | Practical Suffix Tree Construction | 2004 | VLDB |
| 4 | 2,141 | Teseo and the Analysis of Structural Dynamic Graphs | 2021 | VLDB |
| 5 | 6,456 | LSMGraph: A High-Performance Dynamic Graph Storage System with Multi-Level CSR | 2024 | SIGMOD |
| 6 | 2,148 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 7 | 2,013 | Space Efficient Mining of Multigraph Streams | 2005 | PODS |
| 8 | 10,450 | Enabling Efficient Direct Update on Rule-Based Compressed Graph | 2026 | SIGMOD |
| 9 | 10,489 | RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage | 2026 | SIGMOD |
| 10 | 4,946 | Spruce: A Fast yet Space-saving Structure for Dynamic Graph Storage | 2024 | SIGMOD |