{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T12:30:06Z","timestamp":1762000206277,"version":"build-2065373602"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/icc.2017.7996678","type":"proceedings-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T16:39:10Z","timestamp":1501519150000},"page":"1-6","source":"Crossref","is-referenced-by-count":15,"title":["Difference Bloom Filter: A probabilistic structure for multi-set membership query"],"prefix":"10.1109","author":[{"given":"Dongsheng","family":"Yang","sequence":"first","affiliation":[]},{"given":"Deyu","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Junzhi","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Siang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Tong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21968"},{"journal-title":"kbf a bloom filter for key-value storage with an application on approximate state machines","year":"2014","author":"xiong","key":"ref13"},{"journal-title":"Bloom tree A search tree based on bloom filters for multiple-set membership testing","year":"2014","author":"yoon","key":"ref14"},{"journal-title":"A Second Look at Bloom Filters","year":"2008","author":"charles","key":"ref15"},{"key":"ref16","first-page":"201","author":"lu","year":"2005","journal-title":"Bloom filters Design innovations and novel applications"},{"journal-title":"Fast multiset membership testing using combinatorial bloom filters","year":"2009","author":"hao","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2536618"},{"key":"ref19","first-page":"485","article-title":"Network applications of bloom filters: A survey","volume":"1","author":"mitzenmacher","year":"2003","journal-title":"Internet Mathematics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658975"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/35.894379"},{"key":"ref6","first-page":"2196","volume":"4","author":"chang","year":"2004","journal-title":"Approximate caches for packet classification"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626297"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2173351"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CONECT.2003.1231477"},{"journal-title":"Source code of DBF","year":"0","key":"ref2"},{"journal-title":"Our Homepage","year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876476"}],"event":{"name":"ICC 2017 - 2017 IEEE International Conference on Communications","start":{"date-parts":[[2017,5,21]]},"location":"Paris, France","end":{"date-parts":[[2017,5,25]]}},"container-title":["2017 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7985734\/7996317\/07996678.pdf?arnumber=7996678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T19:49:21Z","timestamp":1503517761000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7996678\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/icc.2017.7996678","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}