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

Revision as of 00:18, 16 April 2021

Revision as of 01:25, 16 April 2021

Line 21:

*'''Keep'''. The article needs some more work, but I have added some additional references, more are quite readily available (from searching "one-pass algorithm" or "single-pass algorithm") and it seems fine to me as a stub. '''[[User:JPxG|jp]]'''×'''[[User talk:JPxG|g]]''' 23:22, 15 April 2021 (UTC)

*'''Actually, maybe fold into [[streaming algorithm]]'''. I've twice seen material here that's more about particular kinds of streaming algorithm and not about one-pass algorithms in general. First, with the earlier material on cluster representatives, and recently with an assertion that one-pass algorithms work by filtering -- reading input blocks and writing output blocks. Some do, but I don't think any of the original examples do (e.g., finding the sum of a list of numbers). On the other hand, I believe both techniques can just as well be used with multi-pass streaming algorithms. Certainly filtering can -- ask any UNIX pipeline. Rather than having such useful information continually end up in this article, it might be better to make the body of this article a subsection of [[streaming algorithm]] and leave this page as a redirect to that section. That still recognizes that one-pass algorithms are a thing, but keeps the technical details under [[streaming algorithm]] where (I think) they belong [[User:Dmh|Dmh]] ([[User talk:Dmh|talk]]) 00:18, 16 April 2021 (UTC)

**Not all streaming algorithms are one-pass algorithms. Streaming algorithms are a broader topic. In particular, turnstile model streaming algorithms are not one-pass algorithms. So although this is a subtopic of streaming algorithms, it is distinct enough from the broader topic that I think it can stand on its own. —[[User:David Eppstein|David Eppstein]] ([[User talk:David Eppstein|talk]]) 01:25, 16 April 2021 (UTC)