{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:53Z","timestamp":1750221113494,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"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":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331567","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"207-208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast Concurrent Data Sketches"],"prefix":"10.1145","author":[{"given":"Arik","family":"Rinberg","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Spiegelman","sequence":"additional","affiliation":[{"name":"VMware Research, Herzaliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Bortnikov","sequence":"additional","affiliation":[{"name":"Yahoo Research, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[{"name":"Yahoo Research, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Idit","family":"Keidar","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadar","family":"Serviansky","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213562"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688523"},{"volume-title":"Randomization and Approximation Techniques in Computer Science, Jos'e D","author":"Bar-Yossef Ziv","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594546"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3084693.3104030"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921667"},{"key":"e_1_3_2_1_7_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_8_1","unstructured":"Github. {n. d.}. ArrayIndexOutOfBoundsException during serialization. https:\/\/github.com\/DataSketches\/sketches-core\/issues\/178##issuecomment-365673204. .  Github. {n. d.}. ArrayIndexOutOfBoundsException during serialization. https:\/\/github.com\/DataSketches\/sketches-core\/issues\/178##issuecomment-365673204. ."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993687"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480359.2429109"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2452376.2452456"},{"key":"e_1_3_2_1_12_1","unstructured":"Lee Rhodes. {n. d.}. SketchesArgumentException: Key not found and no empty slot in table. https:\/\/groups.google.com\/d\/msg\/sketches-user\/S1PEAneLmhk\/dI8RbN6iBAAJ. .  Lee Rhodes. {n. d.}. SketchesArgumentException: Key not found and no empty slot in table. https:\/\/groups.google.com\/d\/msg\/sketches-user\/S1PEAneLmhk\/dI8RbN6iBAAJ. ."},{"volume-title":"Multiqueues: Simpler, faster, and better relaxed concurrent priority queues. arXiv preprint arXiv:1411.1209","year":"2014","author":"Rihani Hamza","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Arik Rinberg Alexander Spiegelman Edward Bortnikov Eshcar Hillel Idit Keidar and Hadar Serviansky. 2019. Fast Concurrent Data Sketches. arXiv preprint arXiv:1902.10995 (2019).  Arik Rinberg Alexander Spiegelman Edward Bortnikov Eshcar Hillel Idit Keidar and Hadar Serviansky. 2019. Fast Concurrent Data Sketches. arXiv preprint arXiv:1902.10995 (2019).","DOI":"10.1145\/3293611.3331567"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196930"},{"key":"e_1_3_2_1_16_1","unstructured":"VMware. {n. d.}. Hillview: A Big Data Spreadsheet . https:\/\/github.com\/vmware\/hillview .  VMware. {n. d.}. Hillview: A Big Data Spreadsheet . https:\/\/github.com\/vmware\/hillview ."},{"key":"e_1_3_2_1_17_1","unstructured":"Yahoo. {n. d.}. DataSketches: Concurrent Theta Sketch Implementation . https:\/\/github.com\/DataSketches\/sketches-core\/blob\/master\/src\/main\/java\/com\/yahoo\/sketches\/theta\/ConcurrentDirectQuickSelectSketch.java .  Yahoo. {n. d.}. DataSketches: Concurrent Theta Sketch Implementation . https:\/\/github.com\/DataSketches\/sketches-core\/blob\/master\/src\/main\/java\/com\/yahoo\/sketches\/theta\/ConcurrentDirectQuickSelectSketch.java ."},{"key":"e_1_3_2_1_18_1","unstructured":"Yahoo! {n. d.}. DataSketches: sketches library from Yahoo! https:\/\/datasketches.github.io\/.  Yahoo! {n. d.}. DataSketches: sketches library from Yahoo! https:\/\/datasketches.github.io\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"}],"event":{"name":"PODC '19: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Toronto ON Canada","acronym":"PODC '19"},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331567","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:01Z","timestamp":1750208521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":19,"alternative-id":["10.1145\/3293611.3331567","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331567","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}