Talk:Streaming algorithm

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

computing over data streams is a recent phenomenon that is of growing interest in many areas of computer science, including databases, computer networks, and theory of algorithms. And streaming algorithms are the ones to solve problems in this scenario.

Copyright infringement

Infringing versions of this article, deleted, are stored at Streaming algorithm/deleted revisions 2009-03-01. --Moonriddengirl ^(talk) 14:49, 1 March 2009 (UTC)[reply]

Revamp

Started editing this page on July 7th, 2009. Ashwin.lall (talk) 13:43, 9 July 2009 (UTC)[reply]

New Streaming Problem(s)

In the conclusion of, Every Microsecond Counts: Tracking Fine-Grain Latencies with a Lossy Difference Aggregator, Kompella et al. introduce a new streaming algorithm: two-party coordinated streaming with loss. My interpretation of this is: given a data stream and two synchronized nodes watching this stream, if there is some loss between N_1 and N_2 it becomes impossible for N_2 to accurately monitor the same stream. Their paper develops a method to ignore the losses and still provide answers with some probability of accuracy, but asks the question as to which coordinated functions can be computed with low memory.

I'm not sure if this is a developed enough idea to be presented on the actual wiki-page, nor do I understand this particular field well enough to be certain about my description. If someone more knowledgeable can add this information, please do. Sutekh.destroyer (talk) 20:12, 5 March 2010 (UTC)[reply]

Please clarify "Models" section

In the "Models" section it appears that two different sets of notation are used. One uses $a_{i}$ for incoming data while one uses $x_{i}$ - I might be mistaken and these might actually be intended as different things, but I believe they're referring to the same thing. Could someone please confirm this suspicion, and/or fix the section? Thanks --mcld (talk) 13:43, 30 April 2010 (UTC)[reply]

I think I've fixed the section, by dropping mention of the

x_{i}

. Basically, the

a_{i}

are not necessarily the incoming data, but some vector you have in mind. For instance the incoming data may be a sequence of "updates" of the form

(i,c)

meaning "increment

a_{i}

by

c

". Shreevatsa (talk) 00:28, 17 July 2010 (UTC)[reply]

Redundant sections

The "5.1.1.1 Calculating F0 (Distinct Elements in a DataStream)" and "5.4 Counting distinct elements" sections could be merged as they talk about the same problem. — Preceding unsigned comment added by YassineMR (talk • contribs) 08:18, 18 October 2017 (UTC)[reply]

German Version

I tried to add a link to the German wiki (https://de.wikipedia.org/wiki/Datenstromalgorithmus) but I could not save it. Maybe somebody can fix this. --212.95.5.79 (talk) 08:30, 25 May 2020 (UTC)[reply]