{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T17:40:51Z","timestamp":1655746851859},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2022,5,31]]},"abstract":"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.<\/jats:p>","DOI":"10.1145\/3542700.3542717","type":"journal-article","created":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:10:16Z","timestamp":1654121416000},"page":"69-76","source":"Crossref","is-referenced-by-count":0,"title":["Relative Error Streaming Quantiles"],"prefix":"10.1145","volume":"51","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[{"name":"University of Warwick Coventry, UK"}]},{"given":"Zohar","family":"Karnin","sequence":"additional","affiliation":[{"name":"Amazon, USA"}]},{"given":"Edo","family":"Liberty","sequence":"additional","affiliation":[{"name":"Pinecone San Mateo, CA, USA"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[{"name":"Georgetown University Washington, D.C., USA"}]},{"given":"Pavel","family":"Vesely","sequence":"additional","affiliation":[{"name":"Charles University Prague, Czech Republic"}]}],"member":"320","reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500128"},{"key":"e_1_2_1_2_1","volume-title":"COMAD-95","author":"Agrawal R.","year":"1995","unstructured":"R. Agrawal and A. Swami . A one-pass space-efficient algorithm for finding quantiles . In COMAD-95 , Pune, India , 1995 . R. Agrawal and A. Swami. A one-pass space-efficient algorithm for finding quantiles. In COMAD-95, Pune, India, 1995."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055598"},{"key":"e_1_2_1_4_1","volume-title":"Relative error streaming quantiles. arXiv preprint arXiv:2004.01668","author":"Cormode G.","year":"2020","unstructured":"G. Cormode , Z. Karnin , E. Liberty , J. Thaler , and P. Vesel\u00b4y . Relative error streaming quantiles. arXiv preprint arXiv:2004.01668 , 2020 . G. Cormode, Z. Karnin, E. Liberty, J. Thaler, and P. Vesel\u00b4y. Relative error streaming quantiles. arXiv preprint arXiv:2004.01668, 2020."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.55"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142389"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467152"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387650"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpa.2020.100049"},{"key":"e_1_2_1_10_1","volume-title":"Computing extremely accurate quantiles using t-digests. CoRR, abs\/1902.04023","author":"Dunning T.","year":"2019","unstructured":"T. Dunning and O. Ertl . Computing extremely accurate quantiles using t-digests. CoRR, abs\/1902.04023 , 2019 . T. Dunning and O. Ertl. Computing extremely accurate quantiles using t-digests. CoRR, abs\/1902.04023, 2019."},{"key":"e_1_2_1_11_1","series-title":"LIPIcs","first-page":"775","volume-title":"APPROX\/RANDOM '15","author":"Felber D.","year":"2015","unstructured":"D. Felber and R. Ostrovsky . A randomized online quantile summary in O(1\/epsilon * log(1\/epsilon)) words . In APPROX\/RANDOM '15 , volume 40 of LIPIcs , pages 775 -- 785 , Dagstuhl, Germany , 2015 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik . D. Felber and R. Ostrovsky. A randomized online quantile summary in O(1\/epsilon * log(1\/epsilon)) words. In APPROX\/RANDOM '15, volume 40 of LIPIcs, pages 775--785, Dagstuhl, Germany, 2015. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_12_1","volume-title":"A nearly optimal and deterministic summary structure for update data streams. arXiv preprint cs\/0701020","author":"Ganguly S.","year":"2007","unstructured":"S. Ganguly . A nearly optimal and deterministic summary structure for update data streams. arXiv preprint cs\/0701020 , 2007 . S. Ganguly. A nearly optimal and deterministic summary structure for update data streams. arXiv preprint cs\/0701020, 2007."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375670"},{"key":"e_1_2_1_14_1","first-page":"253","volume-title":"SODA '03","author":"Gupta A.","year":"2003","unstructured":"A. Gupta and F. X. Zane . Counting inversions in lists . In SODA '03 , pages 253 -- 254 , Philadelphia, PA, USA , 2003 . SIAM. A. Gupta and F. X. Zane. Counting inversions in lists. In SODA '03, pages 253--254, Philadelphia, PA, USA, 2003. SIAM."},{"key":"e_1_2_1_15_1","volume-title":"Streaming quantiles algorithms with small space and update time. arXiv preprint arXiv:1907.00236","author":"Ivkin N.","year":"2019","unstructured":"N. Ivkin , E. Liberty , K. Lang , Z. Karnin , and V. Braverman . Streaming quantiles algorithms with small space and update time. arXiv preprint arXiv:1907.00236 , 2019 . N. Ivkin, E. Liberty, K. Lang, Z. Karnin, and V. Braverman. Streaming quantiles algorithms with small space and update time. arXiv preprint arXiv:1907.00236, 2019."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.17"},{"key":"e_1_2_1_17_1","volume-title":"relativeErrorSketch.py. In https: \/\/github.com\/edoliberty\/streaming-quantiles\/","author":"Liberty E.","year":"2021","unstructured":"E. Liberty and P. Vesel\u00b4y . relativeErrorSketch.py. In https: \/\/github.com\/edoliberty\/streaming-quantiles\/ , 2021 . E. Liberty and P. Vesel\u00b4y. relativeErrorSketch.py. In https: \/\/github.com\/edoliberty\/streaming-quantiles\/, 2021."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0424-7"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276342"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304204"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352135"},{"key":"e_1_2_1_22_1","volume-title":"Selection and sorting with limited storage. Theoretical computer science, 12(3):315--323","author":"Munro J. I.","year":"1980","unstructured":"J. I. Munro and M. S. Paterson . Selection and sorting with limited storage. Theoretical computer science, 12(3):315--323 , 1980 . J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoretical computer science, 12(3):315--323, 1980."},{"key":"e_1_2_1_23_1","volume-title":"A minimum storage algorithm for computing the median","author":"Pohl I.","year":"1969","unstructured":"I. Pohl . A minimum storage algorithm for computing the median . IBM TJ Watson Research Center , 1969 . I. Pohl. A minimum storage algorithm for computing the median. IBM TJ Watson Research Center, 1969."},{"issue":"4","key":"e_1_2_1_24_1","first-page":"5","article-title":"Approximate query answering using histograms","volume":"22","author":"Poosala V.","year":"1999","unstructured":"V. Poosala , V. Ganti , and Y. E. Ioannidis . Approximate query answering using histograms . IEEE Data Eng. Bull. , 22 ( 4 ): 5 -- 14 , 1999 . V. Poosala, V. Ganti, and Y. E. Ioannidis. Approximate query answering using histograms. IEEE Data Eng. Bull., 22(4):5--14, 1999.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_25_1","volume-title":"DataSketches: A library of stochastic streaming algorithms. Open source software: https:\/\/datasketches.apache.org\/","author":"Rhodes L.","year":"2013","unstructured":"L. Rhodes , K. Lang , J. Malkin , A. Saydakov , E. Liberty , and J. Thaler . DataSketches: A library of stochastic streaming algorithms. Open source software: https:\/\/datasketches.apache.org\/ , 2013 . L. Rhodes, K. Lang, J. Malkin, A. Saydakov, E. Liberty, and J. Thaler. DataSketches: A library of stochastic streaming algorithms. Open source software: https:\/\/datasketches.apache.org\/, 2013."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031524"},{"key":"e_1_2_1_27_1","volume-title":"How NOT to measure latency. https:\/\/www.youtube.com\/watch?v=lJ8ydIuPFeU","author":"Tene G.","year":"2015","unstructured":"G. Tene . How NOT to measure latency. https:\/\/www.youtube.com\/watch?v=lJ8ydIuPFeU , 2015 . G. Tene. How NOT to measure latency. https:\/\/www.youtube.com\/watch?v=lJ8ydIuPFeU, 2015."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321601"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.145"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3542700.3542717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T17:15:53Z","timestamp":1655745353000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3542700.3542717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5,31]]}},"alternative-id":["10.1145\/3542700.3542717"],"URL":"http:\/\/dx.doi.org\/10.1145\/3542700.3542717","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":["Information Systems","Software"],"published":{"date-parts":[[2022,5,31]]}}}