One-pass algorithm - Revision history

103.160.64.243: /* Example problems solvable by one-pass algorithms */

2023-12-12T14:59:53Z

Example problems solvable by one-pass algorithms

← Previous revision		Revision as of 14:59, 12 December 2023
Line 15:		Line 15:
	* Count the number of times each symbol appears in the input.		* Count the number of times each symbol appears in the input.
	* Find the most or least frequent elements.		* Find the most or least frequent elements.
	* Sort the list according to some order on the symbols (possible since the number of symbols is limited).		* Sort the list according to some order on the symbols (possible since the and after number of symbols is limited).
	* Find the maximum gap between two appearances of a given symbol.		* Find the maximum gap between two appearances of a given symbol.

David Eppstein: Ling Liu (computer scientist)

2023-12-07T08:22:20Z

Ling Liu (computer scientist)

← Previous revision		Revision as of 08:22, 7 December 2023
Line 33:		Line 33:
	== References==		== References==
	<references>		<references>
	<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|encyclopedia=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>		<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|encyclopedia=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|editor-link=Ling Liu (computer scientist)\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>
	<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf\|access-date=2021-07-01}}</ref>		<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf\|access-date=2021-07-01}}</ref>
	<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf\|access-date=2021-07-01}}</ref>		<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf\|access-date=2021-07-01}}</ref>

Citation bot: Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine

2023-09-27T13:03:22Z

Removed parameters. | Use this bot. Report bugs. | #UCB_CommandLine

← Previous revision		Revision as of 13:03, 27 September 2023
Line 34:		Line 34:
	<references>		<references>
	<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|encyclopedia=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>		<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|encyclopedia=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>
	<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf~~\|url-status=live~~\|access-date=2021-07-01}}</ref>		<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf\|access-date=2021-07-01}}</ref>
	<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf~~\|url-status=live~~\|access-date=2021-07-01}}</ref>		<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf\|access-date=2021-07-01}}</ref>
	<ref name="pomdp">{{Cite web\|url=http://www.pomdp.org/tutorial/sondik.html\|title=Sondik's One-Pass Algorithm\|website=www.pomdp.org}}</ref>		<ref name="pomdp">{{Cite web\|url=http://www.pomdp.org/tutorial/sondik.html\|title=Sondik's One-Pass Algorithm\|website=www.pomdp.org}}</ref>
	</references>		</references>

Citation bot: Add: encyclopedia. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 217/1449

2023-08-31T06:13:52Z

Add: encyclopedia. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 217/1449

← Previous revision		Revision as of 06:13, 31 August 2023
Line 33:		Line 33:
	== References==		== References==
	<references>		<references>
	<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|~~work~~=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>		<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|encyclopedia=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>
	<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf\|url-status=live\|access-date=2021-07-01}}</ref>		<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf\|url-status=live\|access-date=2021-07-01}}</ref>
	<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf\|url-status=live\|access-date=2021-07-01}}</ref>		<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf\|url-status=live\|access-date=2021-07-01}}</ref>

Uni3993: /* References */

2022-11-23T00:20:35Z

References

← Previous revision		Revision as of 00:20, 23 November 2022
Line 40:		Line 40:

	{{cs-stub}}		{{cs-stub}}

	{{Algorithmic paradigms}}

	{{DEFAULTSORT:One-Pass Algorithm}}		{{DEFAULTSORT:One-Pass Algorithm}}

Uni3993: /* References */

2022-11-23T00:12:25Z

References

← Previous revision		Revision as of 00:12, 23 November 2022
Line 41:		Line 41:
	{{cs-stub}}		{{cs-stub}}

			{{Algorithmic paradigms}}
	{{Data structures and algorithms}}

	{{DEFAULTSORT:One-Pass Algorithm}}		{{DEFAULTSORT:One-Pass Algorithm}}

Ptrnext: tweak wl

2022-10-08T04:32:30Z

tweak wl

← Previous revision		Revision as of 04:32, 8 October 2022
Line 2:		Line 2:
	{{Refimprove\|date=April 2021}}		{{Refimprove\|date=April 2021}}

	In computing, a '''one-pass algorithm''' or '''single-pass algorithm''' is a [[streaming algorithm]] which reads its input exactly once.<ref name="frankfurt"/> It does so by processing items in order, without unbounded [[Buffer (computer science)\|buffering]]; it reads a block into an [[input buffer]], processes it, and moves the result into an output buffer for each step in the process.<ref name="sjsu"/> A one-pass algorithm generally requires ''O''(''n'') (see [[Big O Notation\|'big O' notation]]) time and less than ''O''(''n'') storage (typically ''O''(1)), where ''n'' is the size of the input.<ref name="eds"/> An example of a one-pass algorithm is the Sondik partially observable [[Markov decision process]].<ref name="pomdp"/>		In computing, a '''one-pass algorithm''' or '''single-pass algorithm''' is a [[streaming algorithm]] which reads its input exactly once.<ref name="frankfurt"/> It does so by processing items in order, without unbounded [[Buffer (computer science)\|buffering]]; it reads a block into an [[input buffer]], processes it, and moves the result into an output buffer for each step in the process.<ref name="sjsu"/> A one-pass algorithm generally requires ''O''(''n'') (see [[Big O Notation\|'big O' notation]]) time and less than ''O''(''n'') storage (typically ''O''(1)), where ''n'' is the size of the input.<ref name="eds"/> An example of a one-pass algorithm is the Sondik [[partially observable Markov decision process]].<ref name="pomdp"/>

	==Example problems solvable by one-pass algorithms==		==Example problems solvable by one-pass algorithms==

Lollipoplollipoplollipop: Fixed cites

2021-07-01T10:17:57Z

Fixed cites

← Previous revision		Revision as of 10:17, 1 July 2021
Line 34:		Line 34:
	<references>		<references>
	<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|work=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>		<ref name="eds">{{Citation\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|date=2009\|url=https://doi.org/10.1007/978-0-387-39940-9_253\|work=Encyclopedia of Database Systems\|pages=1948–1949\|editor-last=LIU\|editor-first=LING\|place=Boston, MA\|publisher=Springer US\|language=en\|doi=10.1007/978-0-387-39940-9_253\|isbn=978-0-387-39940-9\|access-date=2021-04-13\|editor2-last=ÖZSU\|editor2-first=M. TAMER}}</ref>
	<ref name="frankfurt">http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf</ref>		<ref name="frankfurt">{{Cite web\|last=Schweikardt\|first=Nicole\|title=One-Pass Algorithm\|url=http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf\|url-status=live\|access-date=2021-07-01}}</ref>
	<ref name="sjsu">http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf</ref>		<ref name="sjsu">{{Cite web\|last=Pollett\|first=Chris\|date=2005-03-14\|title=One and Two Pass Algorithms\|url=http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf\|url-status=live\|access-date=2021-07-01}}</ref>
	<ref name="pomdp">{{Cite web\|url=http://www.pomdp.org/tutorial/sondik.html\|title=Sondik's One-Pass Algorithm\|website=www.pomdp.org}}</ref>		<ref name="pomdp">{{Cite web\|url=http://www.pomdp.org/tutorial/sondik.html\|title=Sondik's One-Pass Algorithm\|website=www.pomdp.org}}</ref>
	</references>		</references>

MarkH21: Wikipedia:Articles for deletion/One-pass algorithm closed as keep (XFDcloser)

2021-04-21T06:31:48Z

Wikipedia:Articles for deletion/One-pass algorithm closed as keep (XFDcloser)

← Previous revision		Revision as of 06:31, 21 April 2021
Line 1:		Line 1:
	{{Short description\|Type of streaming algorithm}}		{{Short description\|Type of streaming algorithm}}
	<!-- Please do not remove or change this AfD message until the discussion has been closed. -->
	{{Article for deletion/dated\|page=One-pass algorithm\|timestamp=20210413054929\|year=2021\|month=April\|day=13\|substed=yes\|help=off}}
	<!-- Once discussion is closed, please place on talk page: {{Old AfD multi\|page=One-pass algorithm\|date=13 April 2021\|result='''keep'''}} -->
	<!-- End of AfD message, feel free to edit beyond this point -->
	{{Refimprove\|date=April 2021}}		{{Refimprove\|date=April 2021}}

JPxG: Filled in 1 bare reference(s) with reFill 2

2021-04-15T23:12:40Z

Filled in 1 bare reference(s) with reFill 2

← Previous revision		Revision as of 23:12, 15 April 2021
Line 40:		Line 40:
	<ref name="frankfurt">http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf</ref>		<ref name="frankfurt">http://www.tks.informatik.uni-frankfurt.de/schweika/downloads/EncycDBS_OnePassAlgos.pdf</ref>
	<ref name="sjsu">http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf</ref>		<ref name="sjsu">http://www.cs.sjsu.edu/faculty/pollett/157b.12.05s/Lec14032005.pdf</ref>
	<ref name="pomdp">http://www.pomdp.org/tutorial/sondik.html</ref>		<ref name="pomdp">{{Cite web\|url=http://www.pomdp.org/tutorial/sondik.html\|title=Sondik's One-Pass Algorithm\|website=www.pomdp.org}}</ref>
	</references>		</references>