Streamlizing algorithms - Revision history

Hirsutism: redirect to streaming algorithm — completely orphaned, completely unreferenced (none of the links mention "streamlizing"), and zero remotely relavent Google results

2012-09-18T19:12:42Z

redirect to streaming algorithm — completely orphaned, completely unreferenced (none of the links mention "streamlizing"), and zero remotely relavent Google results

← Previous revision		Revision as of 19:12, 18 September 2012
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]]

Snotbot: Fixing improperly nested section headings (task 5)

2011-04-26T03:46:35Z

Fixing improperly nested section headings (task 5)

← Previous revision		Revision as of 03:46, 26 April 2011
Line 4:		Line 4:

	==Streaming Graph==		==Streaming Graph==
	====Semi-streaming Graphs====		===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;
	# ......		# ......

Irbisgreif: Typo fixing and general clean up, removed wikify tag using AWB

2009-11-07T08:16:59Z

Typo fixing and general clean up, removed wikify tag using AWB

← Previous revision		Revision as of 08:16, 7 November 2009
Line 1:		Line 1:
	{{~~Article issues~~\|~~orphan~~ =October ~~2009\|wikify =September~~ 2009}}		{{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.		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.
Line 14:		Line 14:
	*[Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]		*[Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]

			{{DEFAULTSORT:Streamlizing Algorithms}}
	[[Category:Data management]]		[[Category:Data management]]

Katharineamy: Adding links

2009-10-19T22:05:00Z

Adding links

← Previous revision		Revision as of 22:05, 19 October 2009
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==		==Streaming Graph==
	====Semi-streaming Graphs====		====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;
	# ......		# ......

Malcolma: cat

2009-10-19T12:36:06Z

cat

← Previous revision		Revision as of 12:36, 19 October 2009
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}}

SmackBot: Correct standard headers and general fixes, added uncategorised tag, added deadend tag, added orphan tag

2009-10-18T06:21:57Z

Correct standard headers and general fixes, added uncategorised tag, added deadend tag, added orphan tag

← Previous revision		Revision as of 06:21, 18 October 2009
Line 1:		Line 1:
	{{~~wikify~~\|~~date~~=September 2009}}		{{Article issues\|orphan =October 2009\|deadend =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 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.

Line 7:		Line 8:
	# ......		# ......

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

			{{Uncategorized\|date=October 2009}}

58.213.184.66 at 00:59, 18 October 2009

2009-10-18T00:59:45Z

← Previous revision		Revision as of 00:59, 18 October 2009
Line 1:		Line 1:
	{{wikify\|date=September 2009}}		{{wikify\|date=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.		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==		==Streaming Graph==

58.213.188.176: /* External Links */

2009-10-16T02:01:48Z

External Links

← Previous revision		Revision as of 02:01, 16 October 2009
Line 9:		Line 9:
	==External Links==		==External Links==
	1. [WebDB.cn@Southeast University http://sites.google.com/site/webdbp2p/]<br />		1. [WebDB.cn@Southeast University http://sites.google.com/site/webdbp2p/]<br />
	2. [~~Streaming~~ ~~algorithms~~ http://en.~~wikipedia~~.~~org~~/~~wiki~~/~~Streaming_algorithms~~]<br />		2. [WebDB.cn@Southeast University http://cse.seu.edu.cn/people/zhchong/]<br />
	3. [~~Data~~ ~~Stream Mining~~ http://en.wikipedia.org/wiki/~~Data_stream_mining~~]		3. [Streaming algorithms http://en.wikipedia.org/wiki/Streaming_algorithms]<br />
			4. [Data Stream Mining http://en.wikipedia.org/wiki/Data_stream_mining]

221.226.128.181: /* Semi-streaming Graphs */

2009-09-20T14:21:09Z

Semi-streaming Graphs

← Previous revision		Revision as of 14:21, 20 September 2009
Line 3:		Line 3:

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

221.226.128.181: /* Streaming Graph */

2009-09-20T14:20:46Z

Streaming Graph

← Previous revision		Revision as of 14:20, 20 September 2009
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==