Streamlizing algorithms: Difference between revisions

Content deleted Content added

Inline

Revision as of 22:05, 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;

......

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]

@@ Line 1: / Line 1: @@
-{{Article issues|orphan =October 2009|deadend =October 2009|wikify =September 2009}}
+{{Article issues|orphan =October 2009|wikify =September 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.
+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 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;
 # ......