{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T02:06:17Z","timestamp":1746324377506,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1109\/icnp.2008.4697026","type":"proceedings-article","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T21:55:37Z","timestamp":1228859737000},"page":"73-82","source":"Crossref","is-referenced-by-count":6,"title":["Rank-indexed hashing: A compact construction of Bloom filters and variants"],"prefix":"10.1109","author":[{"family":"Nan Hua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiquan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354682"},{"key":"16","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/SFFCS.1999.814585","article-title":"how asymmetry helps load balancing","author":"vocking berthold","year":"1999","journal-title":"Proc Annu Symp Found Comput Sci"},{"journal-title":"Comparison Methods for Stochastic Models and Risks","year":"2002","author":"mu?ller","key":"13"},{"key":"14","first-page":"823","article-title":"an optimal bloom filter replacement","author":"pagh","year":"2005","journal-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803864"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"journal-title":"Software Optimization Guide for AMD Family 10h Processors","year":"0","key":"2"},{"volume":"2 b","journal-title":"Intel 64 and IA-32 architectures software developer's manual","year":"2007","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"7","first-page":"30","article-title":"the bloomier filter: an efficient data structure for static support lookup tables","author":"chazelle","year":"2004","journal-title":"SODA"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"5","first-page":"684","article-title":"an improved construction for counting bloom filters","volume":"4168","author":"bonomi","year":"2006","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159950"},{"key":"9","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/263109.263133","article-title":"small forwarding tables for fast routing lookups","volume":"27","author":"degermark","year":"1997","journal-title":"Computer Communication Review"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"}],"event":{"name":"2008 IEEE International Conference on Network Protocols (ICNP)","start":{"date-parts":[[2008,10,19]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2008,10,22]]}},"container-title":["2008 IEEE International Conference on Network Protocols"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4690865\/4697012\/04697026.pdf?arnumber=4697026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T03:28:23Z","timestamp":1557977303000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4697026\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icnp.2008.4697026","relation":{},"ISSN":["1092-1648"],"issn-type":[{"type":"print","value":"1092-1648"}],"subject":[],"published":{"date-parts":[[2008,10]]}}}