Streamlizing algorithms: Difference between revisions
Content deleted Content added
m Fixing improperly nested section headings (task 5) |
redirect to streaming algorithm — completely orphaned, completely unreferenced (none of the links mention "streamlizing"), and zero remotely relavent Google results |
||
| Line 1: | Line 1: | ||
#REDIRECT [[Streaming algorithm]] |
|||
{{orphan|date=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 stream]]s, invalid many existing [[algorithm]]s for persistent data. Paralleled with persistent data and data streams, [[streaming algorithm]]s 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 (graph theory)|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] |
|||
{{DEFAULTSORT:Streamlizing Algorithms}} |
|||
[[Category:Data management]] |
|||
Latest revision as of 19:12, 18 September 2012
Redirect to: