This is the authors' abstract. We don't add key points for this paper.
Estimating ranks, quantiles, and distributions over streaming data is a central task in data analysis and monitoring. Given a stream of n items from a data universe equipped with a total order, the task is to compute a sketch (data structure) of size polylogarithmic in n. Given the sketch and a query item y, one should be able to approximate its rank in the stream, i.e., the number of stream elements smaller than or equal to y.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Cormode et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: