Streaming Graph Computations with a Helpful Advisor

Details Streaming Graph Computations with a Helpful Advisor Streaming Graph Computations with a Helpful Advisor

2010-04-16

arxiv.org/abs/1004.2899v2

Computer Science

Data Structures and Algorithms

17 pages, 0 figures

Scientific paper

Motivated by the trend to outsource work to commercial cloud computing services, we consider a variation of the streaming paradigm where a streaming algorithm can be assisted by a powerful helper that can provide annotations to the data stream. We extend previous work on such {\em annotation models} by considering a number of graph streaming problems. Without annotations, streaming algorithms for graph problems generally require significant memory; we show that for many standard problems, including all graph problems that can be expressed with totally unimodular integer programming formulations, only a constant number of hash values are needed for single-pass algorithms given linear-sized annotations. We also obtain a protocol achieving \textit{optimal} tradeoffs between annotation length and memory usage for matrix-vector multiplication; this result contributes to a trend of recent research on numerical linear algebra in streaming models.

Affiliated with

Also associated with

No associations

Rating

Streaming Graph Computations with a Helpful Advisor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Streaming Graph Computations with a Helpful Advisor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Streaming Graph Computations with a Helpful Advisor will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624487