Jump to content

Streamlizing algorithms: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
Line 3: Line 3:


==Streaming Graph==
==Streaming Graph==
# Semi-streaming Graphs: with given vertex set V, edges in edge set is shown one by one;
==Semi-streaming Graphs==
With given vertex set V, edges in edge set is shown one by one;
# ......
# ......




==External Links==
==External Links==

Revision as of 14:20, 20 September 2009

As opposed to persistent data stored in memory medium for accessed on demand, transient data originated on line stream by if not explicitly stored. These transient data, called data streams, invalid many existing algorithms for persistent data. Paralleled with persistent data and data streams, streaming algorithms is coined which process streams with sublinear memory cost. Among many methods of designing algorithms for data streams, "streamlizing" algorithms to enable algorithms to process data streams is one of possible research directions.

Streaming Graph

Semi-streaming Graphs

With given vertex set V, edges in edge set is shown one by one;

  1. ......

1. [WebDB.cn@Southeast University http://sites.google.com/site/webdbp2p/]
2. [Streaming algorithms http://en.wikipedia.org/wiki/Streaming_algorithms]
3. [Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]