Talk:Streaming algorithm: Difference between revisions
Ashwin.lall (talk | contribs) |
→New Streaming Problem(s): new section |
||
| Line 6: | Line 6: | ||
==Revamp== |
==Revamp== |
||
Started editing this page on July 7th, 2009. [[User:Ashwin.lall|Ashwin.lall]] ([[User talk:Ashwin.lall|talk]]) 13:43, 9 July 2009 (UTC) |
Started editing this page on July 7th, 2009. [[User:Ashwin.lall|Ashwin.lall]] ([[User talk:Ashwin.lall|talk]]) 13:43, 9 July 2009 (UTC) |
||
== New Streaming Problem(s) == |
|||
In the conclusion of, ''[http://ccr.sigcomm.org/online/files/p255.pdf 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. [[User:Sutekh.destroyer|Sutekh.destroyer]] ([[User talk:Sutekh.destroyer|talk]]) 20:12, 5 March 2010 (UTC) |
|||
Revision as of 20:12, 5 March 2010
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)
Revamp
Started editing this page on July 7th, 2009. Ashwin.lall (talk) 13:43, 9 July 2009 (UTC)
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)