{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T14:48:48Z","timestamp":1766587728046,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972069","61836007","61832017"],"award-info":[{"award-number":["61972069","61836007","61832017"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Municipal Science and Technology R &D Funding Basic Research Program","award":["JCYJ20210324133607021"],"award-info":[{"award-number":["JCYJ20210324133607021"]}]},{"name":"Municipal Government of Quzhou under Grant","award":["2022D037"],"award-info":[{"award-number":["2022D037"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multi-key membership testing plays a crucial role in computing systems and networking applications, encompassing web search, mail systems, distributed databases, firewalls, and network routing. Traditional approaches, such as the Bloom filter, encounter limitations within this specific context. Addressing these challenges, we propose the Multi-key Learned Bloom Filter (MLBF), a hybrid method that combines machine learning techniques with the Bloom filter. The MLBF introduces a value-interaction-based multi-key classifier and a multi-key Bloom filter. Furthermore, we introduce an Interval-based MLBF approach, which categorizes keys into specific intervals based on data distribution to minimize the False Positive Rate (FPR). Additionally, MLBF incorporates an out-of-distribution (OOD) detection component to identify data shifts. Through extensive experimental evaluations on three authentic datasets, we demonstrate the superiority of the proposed MLBF in terms of FPR and query efficiency.<\/jats:p>","DOI":"10.1007\/s41019-023-00224-9","type":"journal-article","created":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T01:02:07Z","timestamp":1693616527000},"page":"234-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Deep Learning-Based Bloom Filter for Efficient Multi-key Membership Testing"],"prefix":"10.1007","volume":"8","author":[{"given":"Haitian","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ziwei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yunchuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ruixin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0217-3998","authenticated-orcid":false,"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"issue":"7","key":"224_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"issue":"4","key":"224_CR2","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1145\/285243.285287","volume":"28","author":"L Fan","year":"1998","unstructured":"Fan L, Cao P, Almeida J, Broder AZ (1998) Summary cache: a scalable wide-area web cache sharing protocol. SIGCOMM 28(4):254\u2013265","journal-title":"SIGCOMM"},{"key":"224_CR3","first-page":"4","volume":"14","author":"F Putze","year":"2010","unstructured":"Putze F, Sanders P, Singler J (2010) Cache-, hash-, and space-efficient bloom filters. JEA 14:4\u20134","journal-title":"JEA"},{"doi-asserted-by":"crossref","unstructured":"Bonomi F, Mitzenmacher M, Panigrahy R, Singh S, Varghese, G (2006) An improved construction for counting bloom filters. In: European symposium on algorithms, pp 684\u2013695","key":"224_CR4","DOI":"10.1007\/11841036_61"},{"doi-asserted-by":"crossref","unstructured":"Fan B, Andersen DG, Kaminsky M, Mitzenmacher MD (2014) Cuckoo filter: practically better than bloom. In: CoNEXT, pp 75\u201388","key":"224_CR5","DOI":"10.1145\/2674005.2674994"},{"issue":"5","key":"224_CR6","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TNET.2002.803864","volume":"10","author":"M Mitzenmacher","year":"2002","unstructured":"Mitzenmacher M (2002) Compressed bloom filters. Trans Netw 10(5):604\u2013612","journal-title":"Trans Netw"},{"doi-asserted-by":"crossref","unstructured":"Kraska T, Beutel A, Chi EH, Dean J, Polyzotis N (2018) The case for learned index structures. In: SIGMOD, pp 489\u2013504","key":"224_CR7","DOI":"10.1145\/3183713.3196909"},{"key":"224_CR8","first-page":"11700","volume":"33","author":"Z Dai","year":"2020","unstructured":"Dai Z, Shrivastava A (2020) Adaptive learned bloom filter (ada-bf): efficient utilization of the classifier with application to real-time information filtering on the web. NIPS 33:11700\u201311710","journal-title":"NIPS"},{"issue":"12","key":"224_CR9","first-page":"2355","volume":"13","author":"Q Liu","year":"2020","unstructured":"Liu Q, Zheng L, Shen Y, Chen L (2020) Stable learned bloom filters for data streams. PVLDB 13(12):2355\u20132367","journal-title":"PVLDB"},{"doi-asserted-by":"crossref","unstructured":"Guo H, Tang R, Ye Y, Li Z, He X (2017) Deepfm: a factorization-machine based neural network for ctr prediction. In: IJCAI, pp 1725\u20131731","key":"224_CR10","DOI":"10.24963\/ijcai.2017\/239"},{"key":"224_CR11","first-page":"18661","volume":"33","author":"P Khosla","year":"2020","unstructured":"Khosla P, Teterwak P, Wang C, Sarna A, Tian Y, Isola P, Maschinot A, Liu C, Krishnan D (2020) Supervised contrastive learning. Adv Neural Inf Process Syst 33:18661\u201318673","journal-title":"Adv Neural Inf Process Syst"},{"unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. In: NIPS, pp 5998\u20136008","key":"224_CR12"},{"doi-asserted-by":"crossref","unstructured":"Kim K, Ji B, Yoon D, Hwang S (2021) Self-knowledge distillation with progressive refinement of targets. In: ICCV, pp 6567\u20136576","key":"224_CR13","DOI":"10.1109\/ICCV48922.2021.00650"},{"doi-asserted-by":"crossref","unstructured":"Lin T-Y, Goyal P, Girshick R, He K, Doll\u00e1r P (2017) Focal loss for dense object detection. In: ICCV, pp 2980\u20132988","key":"224_CR14","DOI":"10.1109\/ICCV.2017.324"},{"doi-asserted-by":"crossref","unstructured":"Kurmanji M, Triantafillou P (2022) Detect, distill and update: learned db systems facing out of distribution data. arXiv preprint arXiv:2210.05508","key":"224_CR15","DOI":"10.1145\/3588713"},{"doi-asserted-by":"crossref","unstructured":"Flajolet P, Fusy \u00c9, Gandouet O, Meunier F (2007) Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In: Discrete Mathematics and Theoretical Computer Science, pp. 137\u2013156","key":"224_CR16","DOI":"10.46298\/dmtcs.3545"},{"doi-asserted-by":"crossref","unstructured":"Cai M, Pan J, Kwok Y-K, Hwang K (2005) Fast and accurate traffic matrix measurement using adaptive cardinality counting. In: SIGCOMM workshop, pp 205\u2013206","key":"224_CR17","DOI":"10.1145\/1080173.1080185"},{"key":"224_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/35.41400","volume":"27","author":"Y LeCun","year":"1989","unstructured":"LeCun Y, Jackel LD, Boser BE, Denker JS, Graf HP, Guyon I, Henderson D, Howard RE, Hubbard WE (1989) Handwritten digit recognition: applications of neural network chips and automatic learning. IEEE Commun Magaz 27:41\u201346","journal-title":"IEEE Commun Magaz"},{"issue":"8","key":"224_CR19","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9(8):1735\u20131780","journal-title":"Neural Comput"},{"unstructured":"Montgomery DC, Peck EA (2001) Introduction to linear regression analysis","key":"224_CR20"},{"issue":"1","key":"224_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.17849\/insm-47-01-31-39.1","volume":"47","author":"SJ Rigatti","year":"2017","unstructured":"Rigatti SJ (2017) Random forest. J Insur Med 47(1):31\u201339","journal-title":"J Insur Med"},{"issue":"18","key":"224_CR22","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 (2013) Bloom filter applications in network security: a state-of-the-art survey. Comput Netw 57(18):4047\u20134064","journal-title":"Comput Netw"},{"issue":"2","key":"224_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang F, Dean J, Ghemawat S, Hsieh WC, Wallach DA, Burrows M, Chandra T, Fikes A, Gruber RE (2008) Bigtable: a distributed storage system for structured data. TOCS 26(2):1\u201326","journal-title":"TOCS"},{"unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. Decentralized Business Review, 21260","key":"224_CR24"},{"doi-asserted-by":"crossref","unstructured":"Mitzenmacher M (2018) A model for learned bloom filters, and optimizing by sandwiching. In: NIPS, pp 462\u2013471","key":"224_CR25","DOI":"10.1007\/978-1-4614-8265-9_751"},{"unstructured":"Rae J, Bartunov S, Lillicrap T (2019) Meta-learning neural bloom filters. In: ICML, pp 5271\u20135280","key":"224_CR26"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00224-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-023-00224-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00224-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T09:03:38Z","timestamp":1695114218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-023-00224-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["224"],"URL":"https:\/\/doi.org\/10.1007\/s41019-023-00224-9","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"type":"print","value":"2364-1185"},{"type":"electronic","value":"2364-1541"}],"subject":[],"published":{"date-parts":[[2023,9]]},"assertion":[{"value":"18 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial, competing or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}