{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:44:51Z","timestamp":1746283491200},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infcomw.2015.7179351","type":"proceedings-article","created":{"date-parts":[[2015,8,12]],"date-time":"2015-08-12T18:45:57Z","timestamp":1439405157000},"page":"77-78","source":"Crossref","is-referenced-by-count":8,"title":["Counting with TinyTable: Every bit counts!"],"prefix":"10.1109","author":[{"given":"Gil","family":"Einziger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy","family":"Friedman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2055243"},{"key":"ref11","article-title":"Rank-indexed hashing: A compact construction of bloom filters and variants","author":"hua","year":"2008","journal-title":"IEEE ICNP"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1773912.1773922"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2401603.2401626"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375472"},{"key":"ref15","article-title":"Venti: A new approach to archival data storage","author":"quinlan","year":"2002","journal-title":"Proc USENIX Conf File and Storage Technologies"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062180"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"ref3","article-title":"An improved construction for counting bloom filters","author":"bonomi","year":"2006","journal-title":"LNCS 4168 14th Annual Euro Symp Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"},{"key":"ref5","article-title":"The bloomier filter: An efficient data structure for static support lookup tables","author":"chazelle","year":"0","journal-title":"Proc of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2015.7179351"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2014.34"},{"year":"0","key":"ref2","article-title":"TinyTable: Implementation"},{"year":"0","key":"ref1"},{"key":"ref9","article-title":"Summary cache: A scalable wide-area web cache sharing protocol","author":"fan","year":"2000","journal-title":"IEEE\/ACM Trans Netw"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","start":{"date-parts":[[2015,4,26]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7170114\/7179273\/07179351.pdf?arnumber=7179351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T02:03:40Z","timestamp":1490407420000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7179351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/infcomw.2015.7179351","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}