Database Paper Browser

Back to papers

Space-Efficient Random Walks on Streaming Graphs

Summary: Wharf stores random walks on high-rate streaming graphs compactly using compressed purely-functional binary trees combined with pairing functions. It prunes the walk search space for low-latency, high-throughput updates, outperforming inverted-index and tree baselines. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13187
Venue
VLDB
Year
2023
Pagerank
4.7989929e-05
Overall Rank
7,212 | 49.83%
DOI
10.14778/3565816.3565835

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 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.

Previous Page 1 / 1 Next

Semantically Similar Papers