Wikipedia:Articles for deletion/One-pass algorithm: Difference between revisions

Revision as of 15:45, 14 April 2021

Revision as of 15:46, 14 April 2021

Line 16:

* '''Comment''' IMO the article should be kept and cleaned up. The distinction is important in CS, as a one-pass algorithm by definition can deal with arbitrarily large input with bounded memory. I no longer remember who wrote what, but the definition is clear and useful, and the term itself is clearly in use. To me, the fact that a lot of the references are in things like CS course notes tells me that a Wikipedia page on the topic would be useful, but I don't know where that lands us with Notability standards. The part on cluster representatives seems specific to database algorithms, so I'd be inclined to take it out. I'll see if I can dig up a few references and do a little cleanup [[User:Dmh|--dmh]]

* '''Keep''' I missed the link to [[streaming algorithm]]. With the text on cluster representatives removed, I think this article is about right: The full details, including the mechanics, are covered under [[streaming algorithm]]. This article just calls out that a one-pass algorithm is a particular kind of streaming algorithm, and gives examples of what you can and can't do in one pass. It adds an increment of value over [[streaming algorithm]] but mentions some specifics about one-pass algorithms in particular. The one area of improvement would be the examples. It would be good to call out a case that can be solved in more than one pass but not in one. As to notability, "one-pass" algorithm is definitely a term of art in CS. I think the hits for CS courses attest to this, but I don't think they need to be included in the article as references, since they only support notability and don't particularly add to the understanding beyond what's already in the article. [[User:Dmh|--dmh]]. <!--Template:Undated--><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|undated]] comment added 15:45, 14 April 2021 (UTC)</small> <!--Autosigned by SineBot-->