{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T14:24:31Z","timestamp":1784643871683,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Key-Area Research and Development Program of Guangdong Province","award":["2020B0101390001"],"award-info":[{"award-number":["2020B0101390001"]}]},{"name":"National Natural Science Foundation of China (NSFC)","award":["No. U20A20179"],"award-info":[{"award-number":["No. U20A20179"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599505","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"590-601","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["SketchPolymer: Estimate Per-item Tail Quantile Using One Sketch"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1551-7646","authenticated-orcid":false,"given":"Jiarui","family":"Guo","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0662-4788","authenticated-orcid":false,"given":"Yisen","family":"Hong","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7115-5390","authenticated-orcid":false,"given":"Yuhan","family":"Wu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8075-7939","authenticated-orcid":false,"given":"Yunfei","family":"Liu","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2402-5854","authenticated-orcid":false,"given":"Tong","family":"Yang","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1681-4677","authenticated-orcid":false,"given":"Bin","family":"Cui","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"The source codes related to SketchPolymer. https:\/\/github.com\/SketchPolymer\/ SketchPolymer-code.  The source codes related to SketchPolymer. https:\/\/github.com\/SketchPolymer\/ SketchPolymer-code."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832574"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2011.2173713"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.187"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685289"},{"key":"e_1_3_2_2_6_1","volume-title":"Scalable tail latency estimation for data center networks. arXiv preprint arXiv:2205.01234","author":"Zhao Kevin","year":"2022","unstructured":"Kevin Zhao , Prateesh Goyal , Mohammad Alizadeh , and Thomas E Anderson . Scalable tail latency estimation for data center networks. arXiv preprint arXiv:2205.01234 , 2022 . Kevin Zhao, Prateesh Goyal, Mohammad Alizadeh, and Thomas E Anderson. Scalable tail latency estimation for data center networks. arXiv preprint arXiv:2205.01234, 2022."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/IC2E.2019.00034"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851188"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2533544"},{"key":"e_1_3_2_2_11_1","volume-title":"Selection and sorting with limited storage. Theoretical computer science, 12(3):315--323","author":"Ian Munro J","year":"1980","unstructured":"J Ian Munro and Mike S Paterson . Selection and sorting with limited storage. Theoretical computer science, 12(3):315--323 , 1980 . J Ian Munro and Mike S Paterson. Selection and sorting with limited storage. Theoretical computer science, 12(3):315--323, 1980."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276342"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375670"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2017.v013a014"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.17"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3450980.3450990"},{"key":"e_1_3_2_2_17_1","first-page":"137","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"Flajolet Philippe","year":"2007","unstructured":"Philippe Flajolet , \u00c9ric Fusy , Olivier Gandouet , and Fr\u00e9d\u00e9ric Meunier . Hyperloglog : the analysis of a near-optimal cardinality estimation algorithm . In Discrete Mathematics and Theoretical Computer Science , pages 137 -- 156 . Discrete Mathematics and Theoretical Computer Science , 2007 . Philippe Flajolet, \u00c9ric Fusy, Olivier Gandouet, and Fr\u00e9d\u00e9ric Meunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Discrete Mathematics and Theoretical Computer Science, pages 137--156. Discrete Mathematics and Theoretical Computer Science, 2007."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183726"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP52444.2021.9651940"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523220"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0424-7"},{"key":"e_1_3_2_2_25_1","volume-title":"Proceedings of the VLDB Endowment, 12(12)","author":"Masson Charles","unstructured":"Charles Masson , Jee E Rim , and Homin K Lee . Ddsketch : A fast and fully-mergeable quantile sketch with relative-error guarantees . Proceedings of the VLDB Endowment, 12(12) . Charles Masson, Jee E Rim, and Homin K Lee. Ddsketch: A fast and fully-mergeable quantile sketch with relative-error guarantees. Proceedings of the VLDB Endowment, 12(12)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00156"},{"key":"e_1_3_2_2_27_1","volume-title":"Skew-normal linear mixed models. Journal of data science, 3(4):415--438","author":"Arellano-Valle Reinaldo Boris","year":"2005","unstructured":"Reinaldo Boris Arellano-Valle , Heleno Bolfarine , and Victor H Lachos . Skew-normal linear mixed models. Journal of data science, 3(4):415--438 , 2005 . Reinaldo Boris Arellano-Valle, Heleno Bolfarine, and Victor H Lachos. Skew-normal linear mixed models. Journal of data science, 3(4):415--438, 2005."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/RIDE.2005.15"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.1"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_2_31_1","volume-title":"Squad: combining sketching and sampling is better than either for per-item quantile estimation. arXiv preprint arXiv:2201.01958","author":"Shahout Rana","year":"2022","unstructured":"Rana Shahout , Roy Friedman , and Ran Ben Basat . Squad: combining sketching and sampling is better than either for per-item quantile estimation. arXiv preprint arXiv:2201.01958 , 2022 . Rana Shahout, Roy Friedman, and Ran Ben Basat. Squad: combining sketching and sampling is better than either for per-item quantile estimation. arXiv preprint arXiv:2201.01958, 2022."},{"key":"e_1_3_2_2_32_1","volume-title":"Random sampling with a reservoir. ACM Transactions on Mathe- matical Software (TOMS), 11(1):37--57","author":"Vitter Jeffrey S","year":"1985","unstructured":"Jeffrey S Vitter . Random sampling with a reservoir. ACM Transactions on Mathe- matical Software (TOMS), 11(1):37--57 , 1985 . Jeffrey S Vitter. Random sampling with a reservoir. ACM Transactions on Mathe- matical Software (TOMS), 11(1):37--57, 1985."},{"key":"e_1_3_2_2_33_1","first-page":"398","volume-title":"International conference on database theory","author":"Metwally Ahmed","year":"2005","unstructured":"Ahmed Metwally , Divyakant Agrawal , and Amr El Abbadi . Efficient computation of frequent and top-k elements in data streams . In International conference on database theory , pages 398 -- 412 . Springer , 2005 . Ahmed Metwally, Divyakant Agrawal, and Amr El Abbadi. Efficient computation of frequent and top-k elements in data streams. In International conference on database theory, pages 398--412. Springer, 2005."},{"key":"e_1_3_2_2_34_1","unstructured":"The source code of Bob Hash. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html.  The source code of Bob Hash. http:\/\/burtleburtle.net\/bob\/hash\/evahash.html."},{"key":"e_1_3_2_2_35_1","unstructured":"The CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/overview\/.  The CAIDA Anonymized Internet Traces. http:\/\/www.caida.org\/data\/overview\/."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508865.1508905"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2612695"},{"key":"e_1_3_2_2_38_1","volume-title":"Vaibhav Bajpai, Pasi Saro- lahti, and J\u00f6rg Ott. Measuring web latency and rendering performance: Method, tools & longitudinal dataset. https:\/\/doi.org\/10.5281\/zenodo.2547512","author":"Asrese Alemnew Sheferaw","year":"2019","unstructured":"Alemnew Sheferaw Asrese , Steffie Jacob Eravuchira , Vaibhav Bajpai, Pasi Saro- lahti, and J\u00f6rg Ott. Measuring web latency and rendering performance: Method, tools & longitudinal dataset. https:\/\/doi.org\/10.5281\/zenodo.2547512 , January 2019 . 10.5281\/zenodo.2547512 Alemnew Sheferaw Asrese, Steffie Jacob Eravuchira, Vaibhav Bajpai, Pasi Saro- lahti, and J\u00f6rg Ott. Measuring web latency and rendering performance: Method, tools & longitudinal dataset. https:\/\/doi.org\/10.5281\/zenodo.2547512, January 2019."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2896710"},{"key":"e_1_3_2_2_40_1","first-page":"4","volume-title":"World's fastest","author":"Barefoot","unstructured":"Barefoot tofino : World's fastest p 4 -programmable ethernet switch asics. https: \/\/barefootnetworks.com\/products\/brief-tofino\/. Barefoot tofino: World's fastest p4-programmable ethernet switch asics. https: \/\/barefootnetworks.com\/products\/brief-tofino\/."}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:52Z","timestamp":1750178272000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":40,"alternative-id":["10.1145\/3580305.3599505","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599505","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}