Streamlizing algorithms: Difference between revisions
Content deleted Content added
Irbisgreif (talk | contribs) m Typo fixing and general clean up, removed wikify tag using AWB |
m Fixing improperly nested section headings (task 5) |
||
| Line 4: | Line 4: | ||
==Streaming Graph== |
==Streaming Graph== |
||
===Semi-streaming Graphs=== |
|||
With given [[Vertex (graph theory)|vertex]] set V, edges in edge set is shown one by one; |
With given [[Vertex (graph theory)|vertex]] set V, edges in edge set is shown one by one; |
||
# ...... |
# ...... |
||
Revision as of 03:46, 26 April 2011
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;
- ......
External links
- [WebDB.cn@Southeast University http://sites.google.com/site/webdbp2p/]
- [WebDB.cn@Southeast University http://cse.seu.edu.cn/people/zhchong/]
- [Streaming algorithms http://en.wikipedia.org/wiki/Streaming_algorithms]
- [Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]