{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T18:02:38Z","timestamp":1780941758688,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306365","type":"print"},{"value":"9783031306372","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30637-2_5","type":"book-chapter","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T10:08:13Z","timestamp":1681380493000},"page":"62-79","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Learned Bloom Filter for\u00a0Multi-key Membership Testing"],"prefix":"10.1007","author":[{"given":"Yunchuan","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruixin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,14]]},"reference":[{"issue":"7","key":"5_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":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684\u2013695. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841036_61"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cai, M., Pan, J., Kwok, Y.K., Hwang, K.: Fast and accurate traffic matrix measurement using adaptive cardinality counting. In: SIGCOMM Workshop, pp. 205\u2013206 (2005)","DOI":"10.1145\/1080173.1080185"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1365815.1365816","volume":"26","author":"F Chang","year":"2008","unstructured":"Chang, F., et al.: Bigtable: A distributed storage system for structured data. TOCS 26(2), 1\u201326 (2008)","journal-title":"TOCS"},{"key":"5_CR5","first-page":"11700","volume":"33","author":"Z Dai","year":"2020","unstructured":"Dai, Z., Shrivastava, A.: 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 (2020)","journal-title":"NIPS"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: CoNEXT, pp. 75\u201388 (2014)","DOI":"10.1145\/2674005.2674994"},{"issue":"4","key":"5_CR7","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, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. SIGCOMM 28(4), 254\u2013265 (1998)","journal-title":"SIGCOMM"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. In: Discrete Mathematics and Theoretical Computer Science, pp. 137\u2013156 (2007)","DOI":"10.46298\/dmtcs.3545"},{"issue":"18","key":"5_CR9","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":"5_CR10","doi-asserted-by":"crossref","unstructured":"Guo, H., Tang, R., Ye, Y., Li, Z., He, X.: DeepFM: a factorization-machine based neural network for CTR prediction. In: IJCAI, p. 1725\u20131731 (2017)","DOI":"10.24963\/ijcai.2017\/239"},{"issue":"8","key":"5_CR11","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.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997)","journal-title":"Neural Comput."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kim, K., Ji, B., Yoon, D., Hwang, S.: Self-knowledge distillation with progressive refinement of targets. In: ICCV, pp. 6567\u20136576 (2021)","DOI":"10.1109\/ICCV48922.2021.00650"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: SIGMOD, pp. 489\u2013504 (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/35.41400","volume":"27","author":"Y LeCun","year":"1989","unstructured":"LeCun, Y., et al.: Handwritten digit recognition: applications of neural network chips and automatic learning. IEEE Commun. Mag. 27, 41\u201346 (1989)","journal-title":"IEEE Commun. Mag."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Lin, T.Y., Goyal, P., Girshick, R., He, K., Doll\u00e1r, P.: Focal loss for dense object detection. In: ICCV, pp. 2980\u20132988 (2017)","DOI":"10.1109\/ICCV.2017.324"},{"issue":"12","key":"5_CR16","first-page":"2355","volume":"13","author":"Q Liu","year":"2020","unstructured":"Liu, Q., Zheng, L., Shen, Y., Chen, L.: Stable learned bloom filters for data streams. PVLDB 13(12), 2355\u20132367 (2020)","journal-title":"PVLDB"},{"issue":"5","key":"5_CR17","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TNET.2002.803864","volume":"10","author":"M Mitzenmacher","year":"2002","unstructured":"Mitzenmacher, M.: Compressed bloom filters. Trans. Netw. 10(5), 604\u2013612 (2002)","journal-title":"Trans. Netw."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A model for learned bloom filters, and optimizing by sandwiching. In: NIPS, pp. 462\u2013471 (2018)","DOI":"10.1007\/978-1-4614-8265-9_751"},{"key":"5_CR19","unstructured":"Montgomery, D.C., Peck, E.A.: Introduction to Linear Regression Analysis (2001)"},{"key":"5_CR20","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Decentralized Bus. Rev. 21260 (2008)"},{"key":"5_CR21","first-page":"4","volume":"14","author":"F Putze","year":"2010","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient bloom filters. JEA 14, 4 (2010)","journal-title":"JEA"},{"key":"5_CR22","unstructured":"Rae, J., Bartunov, S., Lillicrap, T.: Meta-learning neural bloom filters. In: ICML, pp. 5271\u20135280 (2019)"},{"issue":"1","key":"5_CR23","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, S.J.: Random forest. J. Insur. Med. 47(1), 31\u201339 (2017)","journal-title":"J. Insur. Med."},{"key":"5_CR24","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NIPS, pp. 5998\u20136008 (2017)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30637-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:09:37Z","timestamp":1710263377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30637-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306365","9783031306372"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30637-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"14 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","order":11,"name":"conference_url","label":"Conference URL","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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":"3","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":"7.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}