Approximate quantiles and the order of the stream

Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independently from some distribution. The distribution is unknown, but the order in which the samples are presented to us will not be completely adversarial. In this paper, we investigate the importance of the ordering of a data stream, without making any assumptions about the actual distribution of the data. Using quantiles as an example application, we show that we can design provably better algorithms, and settle several open questions on the impact of order on streams. With the recent impetus in the investigation of models for sensor networks, we believe that our approach will allow the construction of novel and significantly improved algorithms. Categories and Subject Descriptors F.2 [Analysis of Algorithms & Problem Complexity] General Terms Algorithms, Design, Performance, Theory Keywords quantiles, data str...

• Type: Conference
• Year: 2006
• Where: PODS
• Authors: Sudipto Guha, Andrew McGregor
• Keywords: Adversarial Order, Better Algorithms, Database, General Terms Algorithms, PODS 2006