{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:14:53Z","timestamp":1760080493069,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811598289"},{"type":"electronic","value":"9789811598296"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-981-15-9829-6_60","type":"book-chapter","created":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T22:02:50Z","timestamp":1616018570000},"page":"775-789","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Survey on Bloom Filter for Multiple Sets"],"prefix":"10.1007","author":[{"given":"Lilapati","family":"Waikhom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7572-1054","authenticated-orcid":false,"given":"Sabuzima","family":"Nayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ripon","family":"Patgiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,18]]},"reference":[{"issue":"7","key":"60_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"60_CR2","unstructured":"Blustein, J., El-Maazawi, A.: Bloom filters. a tutorial, analysis, and survey. Dalhousie University, Halifax, NS, pp. 1\u201331 (2002)"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) Algorithms\u2014ESA 2006, pp. 684\u2013695. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006)","DOI":"10.1007\/11841036_61"},{"key":"60_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.comcom.2015.06.011","volume":"68","author":"L Calderoni","year":"2015","unstructured":"Calderoni, L., Palmieri, P., Maio, D.: Location privacy without mutual trust: the spatial bloom filter. Comput. Commun. 68, 4\u201316 (2015)","journal-title":"Comput. Commun."},{"key":"60_CR5","doi-asserted-by":"crossref","unstructured":"Chang, D.C., Chen, C., Thanavel, M.: Dynamic reordering bloom filter. In: 2017 19th Asia-Pacific network operations and management symposium (APNOMS), pp. 288\u2013291. IEEE (2017)","DOI":"10.1109\/APNOMS.2017.8094131"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Chang, F., Wu-chang Feng, K.L.: Approximate caches for packet classification. In: IEEE INFOCOM 2004. vol.\u00a04, pp. 2196\u20132207 (2004)","DOI":"10.1109\/INFCOM.2004.1354643"},{"key":"60_CR7","doi-asserted-by":"publisher","unstructured":"Concas, F., Xu, P., Hoque, M.A., Lu, J., Tarkoma, S.: Multiple set matching with bloom matrix and bloom vector. ACM Trans. Knowl. Discov. Data 14(2) (2020). https:\/\/doi.org\/10.1145\/3372409","DOI":"10.1145\/3372409"},{"key":"60_CR8","doi-asserted-by":"publisher","unstructured":"Dai, H., Zhong, Y., Liu, A.X., Wang, W., Li, M.: Noisy bloom filters for multi-set membership testing. In: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp. 139\u2013151. SIGMETRICS 16, Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2896377.2901451","DOI":"10.1145\/2896377.2901451"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Dillinger, P.C., Manolios, P.: Fast and accurate bitstate verification for spin. In: International SPIN Workshop on Model Checking of Software, pp. 57\u201375. Springer (2004)","DOI":"10.1007\/978-3-540-24732-6_5"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. In: IEEE\/ACM Transactions on Networking, pp. 254\u2013265 (1998)","DOI":"10.1145\/285243.285287"},{"key":"60_CR11","unstructured":"Gupta, G., Yan, M., Coleman, B., Elworth, R.A.L., Medini, T., Treangen, T., Shrivastava, A.: Rambo: Repeated and merged bloom filter for ultra-fast multiple set membership testing (MSMT) on large-scale data (2019)"},{"issue":"1","key":"60_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/TNET.2011.2173351","volume":"20","author":"F Hao","year":"2012","unstructured":"Hao, F., Kodialam, M., Lakshman, T.V., Song, H.: Fast dynamic multiple-set membership testing using combinatorial bloom filters. IEEE\/ACM Tran. Network. 20(1), 295\u2013304 (2012). https:\/\/doi.org\/10.1109\/TNET.2011.2173351","journal-title":"IEEE\/ACM Tran. Network."},{"key":"60_CR13","doi-asserted-by":"crossref","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: building a better bloom filter. In: European Symposium on Algorithms, pp. 456\u2013467. Springer (2006)","DOI":"10.1007\/11841036_42"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Lee, J., Lim, H.: A circled bloom filter for the membership identification of multiple sets. In: 2019 International Conference on Electronics, Information, and Communication (ICEIC), pp.\u00a01\u20133 (2019)","DOI":"10.23919\/ELINFOCOM.2019.8706480"},{"issue":"2","key":"60_CR15","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1109\/COMST.2018.2889329","volume":"21","author":"L Luo","year":"2018","unstructured":"Luo, L., Guo, D., Ma, R.T., Rottenstreich, O., Luo, X.: Optimizing bloom filter: challenges, solutions, and comparisons. IEEE Commun. Surv. Tutor. 21(2), 1912\u20131949 (2018)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"7","key":"60_CR16","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1109\/TKDE.2016.2535286","volume":"28","author":"M Mitzenmacher","year":"2016","unstructured":"Mitzenmacher, M., Reviriego, P., Pontarelli, S.: Omass: One memory access set separation. IEEE Trans. Knowl. Data Eng. 28(7), 1940\u20131943 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"60_CR17","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press (2017)"},{"key":"60_CR18","doi-asserted-by":"crossref","unstructured":"Sun, Z., Gao, S., Liu, B., Wang, Y., Yang, T., Cui, B.: Magic cube bloom filter: answering membership queries for multiple sets. In: 2019 IEEE International Conference on Big Data and Smart Computing (BigComp), pp.\u00a01\u20138 (2019)","DOI":"10.1109\/BIGCOMP.2019.8679119"},{"key":"60_CR19","doi-asserted-by":"crossref","unstructured":"Xu, C., Liu, Q., Rao, W.: BMF: An indexing structure to support multi-element check. In: International Conference on Web-Age Information Management, pp. 441\u2013453. Springer (2016)","DOI":"10.1007\/978-3-319-39937-9_34"},{"key":"60_CR20","doi-asserted-by":"crossref","unstructured":"Yang, D., Tian, D., Gong, J., Gao, S., Yang, T., Li, X.: Difference bloom filter: a probabilistic structure for multi-set membership query. In: 2017 IEEE International Conference on Communications (ICC), pp.\u00a01\u20136 (2017)","DOI":"10.1109\/ICC.2017.7996678"},{"key":"60_CR21","doi-asserted-by":"crossref","unstructured":"Yang, T., Liu, A.X., Shahzad, M., Zhong, Y., Fu, Q., Li, Z., Xie, G., Li, X.: A shifting bloom filter framework for set queries. arXiv preprint arXiv:1510.03019 (2015)","DOI":"10.14778\/2876473.2876476"},{"issue":"5","key":"60_CR22","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1109\/TMC.2016.2592902","volume":"16","author":"J Yu","year":"2016","unstructured":"Yu, J., Chen, L., Zhang, R., Wang, K.: On missing tag detection in multiple-group multiple-region RFID systems. IEEE Trans. Mob. Comput. 16(5), 1371\u20131381 (2016)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"60_CR23","doi-asserted-by":"publisher","unstructured":"Yu, M., Fabrikant, A., Rexford, J.: Buffalo: bloom filter forwarding architecture for large organizations. In: Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies. pp. 313\u2013324. CoNEXT \u201909, Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1658939.1658975","DOI":"10.1145\/1658939.1658975"}],"container-title":["Smart Innovation, Systems and Technologies","Modeling, Simulation and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-9829-6_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,26]],"date-time":"2024-08-26T05:40:00Z","timestamp":1724650800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-9829-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811598289","9789811598296"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-9829-6_60","relation":{},"ISSN":["2190-3018","2190-3026"],"issn-type":[{"type":"print","value":"2190-3018"},{"type":"electronic","value":"2190-3026"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}