The Community for Technology Leaders
Green Image
In this paper, we present new algorithms for dynamically computing quantiles of a relation subject to insert as well as delete operations. At the core of our algorithms lies a small-space multiresolution representation of the underlying data distribution based on random subset sums or RSSs. These RSSs are updated with every insert and delete operation. When quantiles are demanded, we use these RSSs to estimate quickly, without having to access the data, all the quantiles, each guaranteed to be accurate to within user-specified precision. While quantiles have found many uses in databases, in this paper, our focus is primarily on network management applications that monitor the distribution of active sessions in the network. Our examples are drawn both from the telephony and the IP network, where the goal is to monitor the distribution of the length of active calls and IP flows, respectively, over time. For such applications, we propose a new type of histogram that uses RSSs for summarizing the dynamic parts of the distributions while other parts with small volume of sessions are approximated using simple counters.
Index Terms- Quantiles, database statistics, data streams.

A. C. Gilbert, M. J. Strauss, S. Muthukrishnan and Y. Kotidis, "Domain-Driven Data Synopses for Dynamic Quantiles," in IEEE Transactions on Knowledge & Data Engineering, vol. 17, no. , pp. 927-938, 2005.
90 ms
(Ver 3.3 (11022016))