Jump to content

Streamlizing algorithms: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
SmackBot (talk | contribs)
m Correct standard headers and general fixes, added uncategorised tag, added deadend tag, added orphan tag
m cat
Line 9: Line 9:


==External links==
==External links==
1. [WebDB.cn@Southeast University http://sites.google.com/site/webdbp2p/]<br />
*[WebDB.cn@Southeast University http://sites.google.com/site/webdbp2p/]
2. [WebDB.cn@Southeast University http://cse.seu.edu.cn/people/zhchong/]<br />
*[WebDB.cn@Southeast University http://cse.seu.edu.cn/people/zhchong/]
3. [Streaming algorithms http://en.wikipedia.org/wiki/Streaming_algorithms]<br />
*[Streaming algorithms http://en.wikipedia.org/wiki/Streaming_algorithms]
4. [Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]
*[Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]


[[Category:Data management]]
{{Uncategorized|date=October 2009}}

Revision as of 12:36, 19 October 2009

As opposed to persistent data stored in memory medium for access on demand, transient data originated on line streams are lost 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. ......