{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T18:43:32Z","timestamp":1780512212279,"version":"3.54.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T00:00:00Z","timestamp":1658793600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,26]],"date-time":"2022-07-26T00:00:00Z","timestamp":1658793600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872178"],"award-info":[{"award-number":["61872178"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s00778-022-00755-z","type":"journal-article","created":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T13:18:51Z","timestamp":1658927931000},"page":"525-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Pareto optimal Bloom filter family with hash adaptivity"],"prefix":"10.1007","volume":"32","author":[{"given":"Meng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rongbiao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0545-8187","authenticated-orcid":false,"given":"Haipeng","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"He","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wanchun","family":"Dou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,26]]},"reference":[{"key":"755_CR1","unstructured":"Our source codes. https:\/\/github.com\/njulands\/HashAdaptiveBF"},{"issue":"7","key":"755_CR2","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":"755_CR3","doi-asserted-by":"crossref","unstructured":"Sears, R., Ramakrishnan, R.: BLSM: a general purpose log structured merge tree. In: Proceedings of the International Conference on Management of Data. ACM (2012)","DOI":"10.1145\/2213836.2213862"},{"key":"755_CR4","doi-asserted-by":"crossref","unstructured":"O\u2019Neil, P., Cheng, E., Gawlick, D., O\u2019Neil, E.: The log-structured merge-tree (lsm-tree). Acta Informatica. Springer, pp. 351\u2013385 (1996)","DOI":"10.1007\/s002360050048"},{"key":"755_CR5","unstructured":"Leveldb. a fast and lightweight key\/value database library (2011). http:\/\/code.google.com\/p\/leveldb\/"},{"key":"755_CR6","unstructured":"A facebook fork of leveldb which is optimized for flash and big memory machines (2013). https:\/\/rocksdb.org\/"},{"key":"755_CR7","doi-asserted-by":"crossref","unstructured":"Mackert, L.F., Lohman, G.M.: R* optimizer validation and performance evaluation for distributed queries. In: Proceedings of International Conference on Very Large Data Bases. VLDB Endowment (1986)","DOI":"10.1145\/16894.16863"},{"key":"755_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11227-006-8295-0","volume":"1","author":"B Xiao","year":"2006","unstructured":"Xiao, B., Chen, W., He, Y.: A novel approach to detecting ddos attacks at an early stage. J. Supercomput. 1, 235\u2013248 (2006)","journal-title":"J. Supercomput."},{"key":"755_CR9","doi-asserted-by":"crossref","unstructured":"Bruck, J., Gao, J., Jiang, A.: Weighted Bloom filter. In: Proceedings of International Symposium on Information Theory. IEEE (2006)","DOI":"10.1109\/ISIT.2006.261978"},{"key":"755_CR10","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the International Conference on Management of Data. ACM (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"755_CR11","unstructured":"Dai, Z., Shrivastava, A.: Adaptive learned Bloom filter (Ada-BF). Efficient utilization of the classifier. arXiv preprint (2019)"},{"key":"755_CR12","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: A model for learned Bloom filters and optimizing by sandwiching. In: Advances in Neural Information Processing Systems. Curran. (2018)","DOI":"10.1007\/978-1-4614-8265-9_751"},{"key":"755_CR13","doi-asserted-by":"crossref","unstructured":"Deeds, K., Hentschel, B., Idreos, S.: Stacked filters: learning to filter by structure In: Proceedings of International Conference on Very Large Data Bases. VLDB Endowment (2021)","DOI":"10.14778\/3436905.3436919"},{"key":"755_CR14","doi-asserted-by":"crossref","unstructured":"Dai, H.P., Zhong, Y.K., Liu, A.X., Wang, W., Li, M.: Noisy Bloom filters for multi-set membership testing. In: Proceedings of the International Conference on Measurement and Modeling of Computer Science. ACM (2016)","DOI":"10.1145\/2896377.2901451"},{"key":"755_CR15","first-page":"1","volume":"1","author":"TM Graf","year":"2020","unstructured":"Graf, T.M., Lemire, D.: Xor filters: Faster and smaller than bloom and cuckoo filters. J. Experim. Algorithm. 1, 1\u201316 (2020)","journal-title":"J. Experim. Algorithm."},{"key":"755_CR16","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral Bloom filters. In: Proceedings of the International Conference on Management of Data. ACM (2003)","DOI":"10.1145\/872757.872787"},{"key":"755_CR17","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. Trans. Knowl. Data Eng. 22, 120\u2013133 (2009)","journal-title":"Trans. Knowl. Data Eng."},{"key":"755_CR18","doi-asserted-by":"crossref","unstructured":"Kirsch, A., Mitzenmacher, M.: Less hashing, same performance: building a better bloom filter. In: Proceedings of European Symposium on Algorithms. Springer (2006)","DOI":"10.1007\/11841036_42"},{"key":"755_CR19","doi-asserted-by":"crossref","unstructured":"Hao, F., Kodialam, M., Lakshman, T.: Building high accuracy Bloom filters using partitioned hashing. In: International Conference on Measurement and Modeling of Computer Systems. ACM (2007)","DOI":"10.1145\/1254882.1254916"},{"key":"755_CR20","doi-asserted-by":"crossref","unstructured":"Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using stable Bloom filters. In: Proceedings of the international conference on Management of data. ACM (2006)","DOI":"10.1145\/1142473.1142477"},{"key":"755_CR21","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, 604\u2013612 (2002)","journal-title":"Trans. Netw."},{"issue":"3","key":"755_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/1384609.1384614","volume":"38","author":"C Henke","year":"2008","unstructured":"Henke, C., Schmoll, C., Zseby, T.: Empirical evaluation of hash functions for multipoint measurements. ACM SIGCOMM Comput. Commun. Rev. 38(3), 39\u201350 (2008)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"755_CR23","doi-asserted-by":"crossref","unstructured":"Est\u00e9banez, C., Saez, Y., Recio, G., Isasi, P.: Performance of the most common non-cryptographic hash functions. Softw.: Pract. Experience 44(6), 681\u2013698 (2014)","DOI":"10.1002\/spe.2179"},{"key":"755_CR24","unstructured":"Lovett, K.: Miscellaneous hash functions. http:\/\/www.call-with-current-continuation.org\/eggs\/hashes.html"},{"key":"755_CR25","unstructured":"Rae, J.W., Bartunov, S., Lillicrap, T.P.: Meta-Learning Neural Bloom Filters. In: Proceedings of International Conference on Machine Learning. ACM (2019)"},{"key":"755_CR26","doi-asserted-by":"crossref","unstructured":"Bhattacharya, A., Bedathur, S., Bagchi, A.: Adaptive learned bloom filters under incremental workloads. In: Proceedings of India Joint International Conference on Data Science and Management of Data. ACM (2020)","DOI":"10.1145\/3371158.3371171"},{"key":"755_CR27","unstructured":"Realtime URI Blacklist. http:\/\/uribl.com\/"},{"key":"755_CR28","doi-asserted-by":"crossref","unstructured":"Babcock, B., Olston, C.: Distributed top-k monitoring. In: Proceedings of the International Conference on Management of Data. ACM (2003)","DOI":"10.1145\/872757.872764"},{"key":"755_CR29","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. Transactions on Database Systems. ACM, pp. 249\u2013278 (2005)","DOI":"10.1145\/1061318.1061325"},{"key":"755_CR30","unstructured":"Wu, F., Yang, M.H., Zhang, B., Du, D.H.: Ac-key: Adaptive caching for lsm-based key-value stores. In: Proceedings of Annual Technical Conference. USENIX (2020)"},{"key":"755_CR31","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: Evidence and implications. In: Proceedings of International Conference on Computer Communications. IEEE (1999)","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"755_CR32","unstructured":"Li, Y., Tian, C., Guo, F., Li, C., Xu, Y.: Elasticbf: elastic bloom filter with hotness awareness for boosting read performance in large key-value stores. In: Proceedings of Annual Technical Conference. USENIX (2019)"},{"key":"755_CR33","doi-asserted-by":"crossref","unstructured":"Xie, R.B., Li, M., Miao, Z.Y., Gu, R., Huang, H. Dai, H.P., Chen, G.H.: Hash Adaptive Bloom Filter. In: Proceedings of International Conference on Data Engineering. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00061"},{"issue":"3","key":"755_CR34","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. Netw. 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"755_CR35","doi-asserted-by":"crossref","unstructured":"Gosselin-Lavigne, M.A., Gonzalez, H., Stakhanova, N., Ghorbani, A.A.: A performance evaluation of hash functions for ip reputation lookup using Bloom filters. In: Proceedings of International Conference on Availability, Reliability and Security. IEEE (2015)","DOI":"10.1109\/ARES.2015.101"},{"key":"755_CR36","doi-asserted-by":"crossref","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: a survey. Internet mathematics ,pp. 485\u2013509 (2004)","DOI":"10.1080\/15427951.2004.10129096"},{"key":"755_CR37","unstructured":"Peter C. Dillinger and Lorenz H\u00fcbschle-Schneider and Peter Sanders and Stefan Walzer: Fast Succinct Retrieval and Approximate Membership using Ribbon. arXiv preprint arXiv:abs\/2109.01892 (2021)"},{"key":"755_CR38","doi-asserted-by":"crossref","unstructured":"Zhong, M., Lu, P., Shen, K., Seiferas, J.: Optimizing data popularity conscious Bloom filters. In: Proceedings of symposium on Principles of distributed computing. ACM (2008)","DOI":"10.1145\/1400751.1400798"},{"key":"755_CR39","doi-asserted-by":"crossref","unstructured":"Dayan, N., Athanassoulis, M., Idreos, S.: Monkey: Optimal navigable key-value store. In: International Conference on Management of Data. ACM, pp. 79\u201394 (2017)","DOI":"10.1145\/3035918.3064054"},{"key":"755_CR40","doi-asserted-by":"crossref","unstructured":"Byun, H., Lim, H.: Learned FBF: learning-based functional bloom filter for key-value storage. Trans. Comput 1, 1 (2021)","DOI":"10.1109\/TC.2021.3112079"},{"key":"755_CR41","unstructured":"Dillinger, P.C.: Adaptive approximate state storage. Ph.D. thesis, Northeastern University (2010)"},{"key":"755_CR42","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G., Littlewood, D.: Inequalities. Cambridge University Press (1952)"},{"key":"755_CR43","unstructured":"Appendix https:\/\/njulimn.github.io\/assets\/pdf\/VLDBJ_Appendix.pdf"},{"key":"755_CR44","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash- and space-efficient bloom filters. In: Proceedings of International conference on Experimental algorithms. Springer (2007)"},{"key":"755_CR45","doi-asserted-by":"crossref","unstructured":"Lang, H., Neumann, T., Kemper, A., Boncz, P.: Performance-optimal filtering: Bloom overtakes cuckoo at high throughput (2019)","DOI":"10.14778\/3303753.3303757"},{"key":"755_CR46","unstructured":"Fastfilter. https:\/\/github.com\/FastFilter\/fastfilter_cpp"},{"key":"755_CR47","doi-asserted-by":"crossref","unstructured":"Cho, K., Van\u00a0Merri\u00ebnboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., Bengio, Y.: Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078 (2014)","DOI":"10.3115\/v1\/D14-1179"},{"key":"755_CR48","doi-asserted-by":"crossref","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. In: Proceedings of the national academy of sciences. National Acad Sciences (1982)","DOI":"10.1073\/pnas.79.8.2554"},{"key":"755_CR49","unstructured":"Keras. https:\/\/keras.io\/"},{"key":"755_CR50","unstructured":"xxhash. https:\/\/github.com\/Cyan4973\/xxHash"},{"key":"755_CR51","unstructured":"Cityhash. https:\/\/github.com\/google\/cityhash"},{"key":"755_CR52","unstructured":"Murmurhash. https:\/\/sites.google.com\/site\/murmurhash\/"},{"key":"755_CR53","unstructured":"Smhasher. https:\/\/github.com\/rurban\/smhasher"},{"key":"755_CR54","unstructured":"R. jenkins. http:\/\/www.burtleburtle.net\/bob\/hash\/doobs.html"},{"key":"755_CR55","unstructured":"Shalla\u2019s blacklists. http:\/\/www.shallalist.de\/index.html"},{"key":"755_CR56","unstructured":"Singhal, K., Weiss, P.: DeepBloom. https:\/\/github.com\/karan1149\/DeepBloom"},{"key":"755_CR57","doi-asserted-by":"crossref","unstructured":"Cooper, B.F., Silberstein, A., Tam, E., Ramakrishnan, R., Sears, R.: Benchmarking cloud serving systems with YCSB. In: Proceedings of Symposium on Cloud Computing. ACM (2010)","DOI":"10.1145\/1807128.1807152"},{"key":"755_CR58","unstructured":"Powers, D.M.: Applications and explanations of Zipf\u2019s law. In: Proceedings of Association for Computational Linguistics. ACL (1998)"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00755-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00755-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00755-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T05:08:44Z","timestamp":1681880924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00755-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,26]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["755"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00755-z","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,26]]},"assertion":[{"value":"3 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}