{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T21:07:26Z","timestamp":1774732046176,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031228285","type":"print"},{"value":"9783031228292","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22829-2_16","type":"book-chapter","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T09:13:44Z","timestamp":1670318024000},"page":"287-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Analysis of\u00a0the\u00a0Hardware-Friendliness of\u00a0AMQ Data Structures for\u00a0Network Security"],"prefix":"10.1007","author":[{"given":"Arish","family":"Sateesan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo","family":"Vliegen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nele","family":"Mentens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,7]]},"reference":[{"key":"16_CR1","unstructured":"How much data is created every day in 2022? https:\/\/earthweb.com\/how-much-data-is-created-every-day\/. Accessed 25 Jul 2022"},{"issue":"6","key":"16_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","volume":"101","author":"PS Almeida","year":"2007","unstructured":"Almeida, P.S., Baquero, C., Pregui\u00e7a, N., Hutchison, D.: Scalable bloom filters. Inf. Process. Lett. 101(6), 255\u2013261 (2007)","journal-title":"Inf. Process. Lett."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bender, M.A., et al.: Don\u2019t thrash: how to cache your hash on flash. In: 3rd Workshop on Hot Topics in Storage and File Systems (HotStorage 11) (2011)","DOI":"10.14778\/2350229.2350275"},{"issue":"7","key":"16_CR4","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"},{"issue":"9","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.14778\/3213880.3213884","volume":"11","author":"AD Breslow","year":"2018","unstructured":"Breslow, A.D., Jayasena, N.S.: Morton filters: faster, space-efficient cuckoo filters via biasing, compression, and decoupled logical sparsity. Proc. VLDB Endowment 11(9), 1041\u20131055 (2018)","journal-title":"Proc. VLDB Endowment"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Celis, P., Larson, P.A., Munro, J.I.: Robin hood hashing. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 281\u2013288. IEEE (1985)","DOI":"10.1109\/SFCS.1985.48"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chen, H., Liao, L., Jin, H., Wu, J.: The dynamic cuckoo filter. In: 2017 IEEE 25th International Conference on Network Protocols (ICNP), pp. 1\u201310. IEEE (2017)","DOI":"10.1109\/ICNP.2017.8117563"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD international conference on Management of data. pp. 241\u2013252 (2003)","DOI":"10.1145\/872757.872787"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Donnet, B., Baynat, B., Friedman, T.: Retouched bloom filters: allowing networked applications to trade off selected false positives against false negatives. In: Proceedings of the 2006 ACM CoNEXT Conference, pp. 1\u201312 (2006)","DOI":"10.1145\/1368436.1368454"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, pp. 75\u201388 (2014)","DOI":"10.1145\/2674005.2674994"},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Networking 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Fu, P., Luo, L., Li, S., Guo, D., Cheng, G., Zhou, Y.: The vertical cuckoo filters: a family of insertion-friendly sketches for online applications. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS) (2021)","DOI":"10.1109\/ICDCS51616.2021.00015"},{"issue":"18","key":"16_CR13","doi-asserted-by":"publisher","first-page":"4047","DOI":"10.1016\/j.comnet.2013.09.003","volume":"57","author":"S Geravand","year":"2013","unstructured":"Geravand, S., Ahmadi, M.: Bloom filter applications in network security: a state-of-the-art survey. Comput. Netw. 57(18), 4047\u20134064 (2013)","journal-title":"Comput. Netw."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3376122","volume":"25","author":"TM Graf","year":"2020","unstructured":"Graf, T.M., Lemire, D.: Xor filters: faster and smaller than bloom and cuckoo filters. J. Exp. Algorithmics (JEA) 25, 1\u201316 (2020)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"1","key":"16_CR15","first-page":"1","volume":"27","author":"TM Graf","year":"2022","unstructured":"Graf, T.M., Lemire, D.: Binary fuse filters: fast and smaller than XOR filters. J. Exp. Algorithmics (JEA) 27(1), 1\u201315 (2022)","journal-title":"J. Exp. Algorithmics (JEA)"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TKDE.2009.57","volume":"22","author":"D Guo","year":"2009","unstructured":"Guo, D., Wu, J., Chen, H., Yuan, Y., Luo, X.: The dynamic bloom filters. IEEE Trans. Knowl. Data Eng. 22(1), 120\u2013133 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms \u2013 ESA 2006","author":"A Kirsch","year":"2006","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: building a better bloom filter. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 456\u2013467. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_42"},{"issue":"12","key":"16_CR18","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1109\/JSAC.2006.884032","volume":"24","author":"A Kumar","year":"2006","unstructured":"Kumar, A., Xu, J., Wang, J.: Space-code bloom filter for efficient per-flow traffic measurement. IEEE J. Sel. Areas Commun. 24(12), 2327\u20132339 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Kumar, S., Turner, J., Crowley, P.: Peacock hashing: deterministic and updatable hashing for high performance networking. In: IEEE INFOCOM 2008-The 27th Conference on Computer Communications, pp. 101\u2013105. IEEE (2008)","DOI":"10.1109\/INFOCOM.2008.29"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Kwon, M., Reviriego, P., Pontarelli, S.: A length-aware cuckoo filter for faster IP lookup. In: 2016 IEEE Conference on Computer Communications Workshops (2016)","DOI":"10.1109\/INFCOMW.2016.7562258"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Lim, H., Fan, B., Andersen, D.G., Kaminsky, M.: Silt: A memory-efficient, high-performance key-value store. In: Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles. pp. 1\u201313 (2011)","DOI":"10.1145\/2043556.2043558"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Luo, L., Guo, D., Rottenstreich, O., Ma, R.T., Luo, X., Ren, B.: The consistent cuckoo filter. In: IEEE INFOCOM 2019, pp. 712\u2013720. IEEE (2019)","DOI":"10.1109\/INFOCOM.2019.8737454"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Pontarelli, S., Reviriego, P.: Adaptive cuckoo filters (2020)","DOI":"10.1145\/3339504"},{"key":"16_CR24","unstructured":"Mitzenmacher, M.D., Vocking, B.: The asymptotics of selecting the shortest of two, improved (1999)"},{"issue":"2","key":"16_CR25","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: A general-purpose counting filter: Making every bit count. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 775\u2013787 (2017)","DOI":"10.1145\/3035918.3035963"},{"key":"16_CR27","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-and space-efficient bloom filters. In: International Workshop on Experimental and Efficient Algorithms (2007)"},{"issue":"1","key":"16_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1109\/TPDS.2013.46","volume":"25","author":"Y Qiao","year":"2013","unstructured":"Qiao, Y., Li, T., Chen, S.: Fast bloom filters and their generalization. IEEE Trans. Parallel Distrib. Syst. 25(1), 93\u2013103 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"16_CR29","first-page":"255","volume":"9","author":"AW Richa","year":"2001","unstructured":"Richa, A.W., Mitzenmacher, M., Sitaraman, R.: The power of two random choices: a survey of techniques and results. Comb. Optim. 9, 255\u2013304 (2001)","journal-title":"Comb. Optim."},{"issue":"6","key":"16_CR30","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1109\/LCOMM.2010.06.100344","volume":"14","author":"CE Rothenberg","year":"2010","unstructured":"Rothenberg, C.E., Macapuna, C.A., Verdi, F.L., Magalhaes, M.F.: The deletable bloom filter: a new member of the bloom family. IEEE Commun. Lett. 14(6), 557\u2013559 (2010)","journal-title":"IEEE Commun. Lett."},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Sateesan, A., Vliegen, J., Daemen, J., Mentens, N.: Novel bloom filter algorithms and architectures for ultra-high-speed network security applications. In: 2020 23rd Euromicro Conference on Digital System Design (DSD), pp. 262\u2013269. IEEE (2020)","DOI":"10.1109\/DSD51259.2020.00050"},{"key":"16_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2022.104619","volume":"93","author":"A Sateesan","year":"2022","unstructured":"Sateesan, A., Vliegen, J., Daemen, J., Mentens, N.: Hardware-oriented optimization of bloom filter algorithms and architectures for ultra-high-speed lookups in network applications. Microprocess. Microsyst. 93, 104619 (2022)","journal-title":"Microprocess. Microsyst."},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Scherrer, S., et al.: Low-rate overuse flow tracer (loft): an efficient and scalable algorithm for detecting overuse flows. In: 2021 40th International Symposium on Reliable Distributed Systems (SRDS). IEEE (2021)","DOI":"10.1109\/SRDS53918.2021.00034"},{"key":"16_CR34","unstructured":"Szabo-Wexler, E.: Approximate membership of sets: A survey (2014)"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Wang, M., Zhou, M.: Vacuum filters: more space-efficient and faster replacement for bloom and cuckoo filters. Proc. VLDB Endowment (2019)","DOI":"10.14778\/3364324.3364333"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Xie, Z., Ding, W., Wang, H., Xiao, Y., Liu, Z.: D-ary cuckoo filter: a space efficient data structure for set membership lookup. In: 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (2017)","DOI":"10.1109\/ICPADS.2017.00035"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22829-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T20:17:41Z","timestamp":1670357861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22829-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031228285","9783031228292"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22829-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy, and Applied Cryptography Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madras","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"space2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.69","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}