{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:33:28Z","timestamp":1758267208409,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5935005","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T14:59:10Z","timestamp":1310050750000},"page":"1997-2005","source":"Crossref","is-referenced-by-count":11,"title":["Optimal sampling algorithms for frequency estimation in distributed data"],"prefix":"10.1109","author":[{"given":"Zengfeng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055597"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1741"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166084"},{"key":"ref14","article-title":"KLEE: A framework for distributed top-k query algorithms","author":"michel","year":"2005","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0055-3"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-642-03351-3_25","article-title":"An Optimal Bloom Filter Replacement Based on Matrix Solving","volume":"5675","author":"porat","year":"2009","journal-title":"Computer Science - Theory and Applications"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031524"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1559795.1559820"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011798"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872764"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066161"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref2","first-page":"327","article-title":"On approximate halfspace range counting and relative varepsilon approximations","author":"aronov","year":"2007","journal-title":"Proceedings of Symposium on Computational Geometry"},{"year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447825"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142394"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","start":{"date-parts":[[2011,4,10]]},"location":"Shanghai, China","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05935005.pdf?arnumber=5935005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T20:34:20Z","timestamp":1560371660000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5935005\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5935005","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}