{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:29:36Z","timestamp":1750220976082,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T00:00:00Z","timestamp":1582070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,2,19]]},"DOI":"10.1145\/3332466.3374512","type":"proceedings-article","created":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:13:53Z","timestamp":1582139633000},"page":"117-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast concurrent data sketches"],"prefix":"10.1145","author":[{"given":"Arik","family":"Rinberg","sequence":"first","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Spiegelman","sequence":"additional","affiliation":[{"name":"VMware Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Bortnikov","sequence":"additional","affiliation":[{"name":"Yahoo Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[{"name":"Yahoo Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[{"name":"Technion and Yahoo Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee","family":"Rhodes","sequence":"additional","affiliation":[{"name":"Verizon Media"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadar","family":"Serviansky","sequence":"additional","affiliation":[{"name":"Weizmann Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,2,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2011. Java Language Specification: Chapter 17 - Threads and Locks. https:\/\/docs.oracle.com\/javase\/specs\/jls\/se7\/html\/jls-17.html.  2011. Java Language Specification: Chapter 17 - Threads and Locks. https:\/\/docs.oracle.com\/javase\/specs\/jls\/se7\/html\/jls-17.html."},{"key":"e_1_3_2_1_2_1","unstructured":"2018. HyperLogLog in Presto: A significantly faster way to handle cardinality estimation https:\/\/code.fb.com\/data-infrastructure\/hyperloglog\/.  2018. HyperLogLog in Presto: A significantly faster way to handle cardinality estimation https:\/\/code.fb.com\/data-infrastructure\/hyperloglog\/."},{"key":"e_1_3_2_1_3_1","unstructured":"2019. Apache DataSketches (Incubating). https:\/\/incubator.apache.org\/clutch\/datasketches.html.  2019. Apache DataSketches (Incubating). https:\/\/incubator.apache.org\/clutch\/datasketches.html."},{"key":"e_1_3_2_1_4_1","unstructured":"2019. ArraylndexOutOfBoundsException during serialization. https:\/\/github.com\/DataSketches\/sketches-core\/issues\/178#issuecomment-365673204.  2019. ArraylndexOutOfBoundsException during serialization. https:\/\/github.com\/DataSketches\/sketches-core\/issues\/178#issuecomment-365673204."},{"key":"e_1_3_2_1_5_1","unstructured":"2019. DataSketches: Concurrent Theta Sketch Implementation. https:\/\/github.com\/apache\/incubator-datasketches-java\/blob\/master\/src\/main\/java\/org\/apache\/datasketches\/theta\/ConcurrentDirectQuickSelectSketch.java.  2019. DataSketches: Concurrent Theta Sketch Implementation. https:\/\/github.com\/apache\/incubator-datasketches-java\/blob\/master\/src\/main\/java\/org\/apache\/datasketches\/theta\/ConcurrentDirectQuickSelectSketch.java."},{"key":"e_1_3_2_1_6_1","unstructured":"2019. Hillview: A Big Data Spreadsheet https:\/\/research.vmware.com\/projects\/hillview.  2019. Hillview: A Big Data Spreadsheet https:\/\/research.vmware.com\/projects\/hillview."},{"key":"e_1_3_2_1_7_1","unstructured":"2019. SketchesArgumentException: Key not found and no empty slot in table. https:\/\/groups.google.com\/d\/msg\/sketches-user\/S1PEAneLmhk\/dl8RbN6iBAAJ..  2019. SketchesArgumentException: Key not found and no empty slot in table. https:\/\/groups.google.com\/d\/msg\/sketches-user\/S1PEAneLmhk\/dl8RbN6iBAAJ.."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17653-1_29"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213562"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210411"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858788.2688523"},{"volume-title":"Randomization and Approximation Techniques in Computer Science, Jos'e D","author":"Bar-Yossef Ziv","key":"e_1_3_2_1_12_1","unstructured":"Ziv Bar-Yossef , T. S. Jayram , Ravi Kumar , D. Sivakumar , and Luca Trevisan . 2002. Counting Distinct Elements in a Data Stream . In Randomization and Approximation Techniques in Computer Science, Jos'e D . P. Rolim and Salil Vadhan (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 1--10. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivakumar, and Luca Trevisan. 2002. Counting Distinct Elements in a Data Stream. In Randomization and Approximation Techniques in Computer Science, Jos'e D. P. Rolim and Salil Vadhan (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 1--10."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375591"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594546"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3084693.3104030"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921667"},{"key":"e_1_3_2_1_17_1","volume-title":"Order statistics. Encyclopedia of Statistical Sciences 9","author":"David Herbert Aron","year":"2004","unstructured":"Herbert Aron David and Haikady Navada Nagaraja . 2004. Order statistics. Encyclopedia of Statistical Sciences 9 ( 2004 ). Herbert Aron David and Haikady Navada Nagaraja. 2004. Order statistics. Encyclopedia of Statistical Sciences 9 (2004)."},{"key":"e_1_3_2_1_18_1","unstructured":"Druid [n.d.]. How We Scaled HyperLogLog: Three Real-World Optimizations. http:\/\/druid.io\/blog\/2014\/02\/18\/hyperloglog-optimizations-for-real-world-systems.html.  Druid [n.d.]. How We Scaled HyperLogLog: Three Real-World Optimizations. http:\/\/druid.io\/blog\/2014\/02\/18\/hyperloglog-optimizations-for-real-world-systems.html."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429109"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"volume-title":"Distributed algorithms","author":"Lynch Nancy A","key":"e_1_3_2_1_22_1","unstructured":"Nancy A Lynch . 1996. Distributed algorithms . Elsevier . Nancy A Lynch. 1996. Distributed algorithms. Elsevier."},{"key":"e_1_3_2_1_23_1","volume-title":"Multi-queues: Simpler, faster, and better relaxed concurrent priority queues. arXiv preprint arXiv.1411.1209","author":"Rihani Hamza","year":"2014","unstructured":"Hamza Rihani , Peter Sanders , and Roman Dementiev . 2014 . Multi-queues: Simpler, faster, and better relaxed concurrent priority queues. arXiv preprint arXiv.1411.1209 (2014). Hamza Rihani, Peter Sanders, and Roman Dementiev. 2014. Multi-queues: Simpler, faster, and better relaxed concurrent priority queues. arXiv preprint arXiv.1411.1209 (2014)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331567"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196930"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"}],"event":{"name":"PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"location":"San Diego California","acronym":"PPoPP '20"},"container-title":["Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374512","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3332466.3374512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:37Z","timestamp":1750204477000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3332466.3374512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,19]]},"references-count":27,"alternative-id":["10.1145\/3332466.3374512","10.1145\/3332466"],"URL":"https:\/\/doi.org\/10.1145\/3332466.3374512","relation":{},"subject":[],"published":{"date-parts":[[2020,2,19]]},"assertion":[{"value":"2020-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}