{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:12:15Z","timestamp":1750911135578,"version":"3.41.0"},"reference-count":18,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016inp0022","type":"journal-article","created":{"date-parts":[[2017,9,30]],"date-time":"2017-09-30T22:24:28Z","timestamp":1506810268000},"page":"2368-2372","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Dimensional Bloom Filter: Design and Evaluation"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Fei","family":"XU","sequence":"first","affiliation":[{"name":"Law School, Renmin University"}]},{"given":"Pinxin","family":"LIU","sequence":"additional","affiliation":[{"name":"Law School, Renmin University"}]},{"given":"Jing","family":"XU","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Jianfeng","family":"YANG","sequence":"additional","affiliation":[{"name":"Law School, Renmin University"}]},{"given":"S.M.","family":"YIU","sequence":"additional","affiliation":[{"name":"The University of Hong Kong"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] J.K. Mullin, \u201cOptimal semijoins for distributed database systems,\u201d IEEE Trans. Softw. Eng., vol.16, no.5, pp.558-560, 1990. 10.1109\/32.52778","DOI":"10.1109\/32.52778"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] J.K. Mullin, \u201cEstimating the size of a relational join,\u201d Information Systems, vol.18, no.3, pp.189-196, 1993. 10.1016\/0306-4379(93)90037-2","DOI":"10.1016\/0306-4379(93)90037-2"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] U. Manber and S. Wu, \u201cAn algorithm for approximate membership checking with application to password security,\u201d Information Processing Letters, vol.50, no.44, pp.191-197, 1994. 10.1016\/0020-0190(94)00032-8","DOI":"10.1016\/0020-0190(94)00032-8"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] D. Sarang, K. Praveen, and E.T. David, \u201cLongest prefix matching using bloom filters,\u201d Proc. ACM SIGCOMM, pp.201-212, 2003.","DOI":"10.1145\/863955.863979"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] L.L. Gremilion, \u201cDesigning a bloom filter for differential file access,\u201d Commun. ACM, vol.25, no.9, pp.600-604, 1982. 10.1145\/358628.358632","DOI":"10.1145\/358628.358632"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] F. Bonomi, M. Mitzenmacher, R. Panigraphy, S. Singh, and G. Varghese, \u201cBeyond bloom filters: From approximate membership checks to approximate state machines,\u201d Proc. ACM SIGCOMM, pp.315-326, 2006. 10.1145\/1151659.1159950","DOI":"10.1145\/1151659.1159950"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] J. Ledlie, J.M. Taylor, L. Serban, and M. Seltzer, \u201cSelf-organization in peer-to-peer systems,\u201d Proc. 10th European SIGOPS Workshop, pp.125-132, 2002. 10.1145\/1133373.1133397","DOI":"10.1145\/1133373.1133397"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] F.M. Cuenca-Acuna, C. Peery, R.P. Martin, and T.D. Nguyen, \u201cPlanetP: Using gossiping to build content addressable peer-to-peer information sharing communities,\u201d Proc. 12th IEEE International Symposium on High Performance Distributed Computing, pp.236-246, 2003. 10.1109\/hpdc.2003.1210033","DOI":"10.1109\/HPDC.2003.1210033"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] S.C. Rhea and J. Kubiatowicz, \u201cProbabilistic location and routing,\u201d Proc. INFOCOM 2002, pp.1248-1257, 2002. 10.1109\/infcom.2002.1019375","DOI":"10.1109\/INFCOM.2002.1019375"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] A. Whitaker and D. Wetherall, \u201cForwarding without loops in Icarus,\u201d Proc. Open Architectures and Network Programming, pp.63-75, 2002. 10.1109\/opnarc.2002.1019229","DOI":"10.1109\/OPNARC.2002.1019229"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] C. Estan and G. Varghese, \u201cNew directions in trace measurement and accounting,\u201d Proc. ACM SIGCOMM, pp.323-336, 2002. 10.1145\/964725.633056","DOI":"10.1145\/964725.633056"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] D.C. Suresh, Z. Guo, B. Buyukkurt, and W.A. Najjar, \u201cAutomatic compilation framework for bloom filter based intrusion detection,\u201d Proc. ARC, pp.413-418 2006. 10.1007\/11802839_49","DOI":"10.1007\/11802839_49"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] P. Gross, J. Parekh, and G. Kaiser, \u201cSecure \u201cselecticast\u201d for collaborative intrusion detection systems,\u201d Proc. International Workshop on Distributed Event-based Systems, pp.50-55, 2004. 10.1049\/ic:20040382","DOI":"10.1049\/ic:20040382"},{"key":"14","unstructured":"[14] M.E. Locasto, J.J. Parekh, A.D. Keromytis, and S.J. Stolfo, \u201cTowards collaborative security and P2P intrusion detection,\u201d Proc. Information Assurance Workshop 2005, pp.30-36, 2005. 10.1109\/iaw.2005.1495971"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] F. Ye, H. Luo, S. Lu, and L. Zhang, \u201cStatistical en-route filtering of injected false data in sensor networks,\u201d IEEE J. Sel. Areas Commun., vol.23, no.4, pp.839-850, 2005. 10.1109\/jsac.2005.843561","DOI":"10.1109\/JSAC.2005.843561"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] W.B. Jaballah, A. Meddeb, and H. Youssef, \u201cAn efficient source authentication scheme in wireless sensor network,\u201d Proc. IEEE\/ACS International Conference on Computer Systems and Applications, pp.1-7, 2010. 10.1109\/aiccsa.2010.5586993","DOI":"10.1109\/AICCSA.2010.5586993"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] Y.-S. Chen and C.-L. Lei, \u201cFiltering false messages en-route in wireless multi-hop networks,\u201d Proc. IEEE Wireless Communications and Networking Conference, pp.1-6, 2010. 10.1109\/wcnc.2010.5506127","DOI":"10.1109\/WCNC.2010.5506127"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] A. Broder and M. Mitzenmacher, \u201cNetwork applications of bloom filters: A survey,\u201d Internet Mathematics, vol.1, no.4, pp.485-509, 2005. 10.1080\/15427951.2004.10129096","DOI":"10.1080\/15427951.2004.10129096"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/10\/E100.D_2016INP0022\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T23:37:04Z","timestamp":1750894624000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/10\/E100.D_2016INP0022\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":18,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016inp0022","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2017]]}}}