{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:29:27Z","timestamp":1760149767688,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"18","license":[{"start":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T00:00:00Z","timestamp":1694217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"],"award-info":[{"award-number":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004479","name":"Natural Science Foundation of Jiangxi Province","doi-asserted-by":"publisher","award":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"],"award-info":[{"award-number":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"]}],"id":[{"id":"10.13039\/501100004479","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jiangxi Provincial Special Program 03 and 5G Projects","award":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"],"award-info":[{"award-number":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"]}]},{"name":"2023 Jiangxi Provincial Special Fund Projects for Graduate Student Innovation","award":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"],"award-info":[{"award-number":["2022YFD1600601","20212BAB202015","20232ABC03A18","YC2023-S413"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Given the challenges associated with the dynamic expansion of the conventional bloom filter\u2019s capacity, the prevalence of false positives, and the subpar access performance, this study employs the algebraic and topological characteristics of p-adic integers to introduce an innovative approach for dynamically expanding the p-adic Integer Scalable Bloom Filter (PSBF). The proposed method involves converting the target element into an integer using a string hash function, followed by the conversion of said integer into a p-adic integer through algebraic properties. This process automatically establishes the topological tree access structure of the PSBF. The experiment involved a comparison of access performance among the standard bloom filter, dynamic bloom filter, and scalable bloom filter. The findings indicate that the PSBF offers advantages such as avoidance of a linear storage structure, enhanced efficiency in element insertion and query, improved storage space utilization, and reduced likelihood of false positives. Consequently, the PSBF presents a novel approach to the dynamic extensibility of bloom filters.<\/jats:p>","DOI":"10.3390\/s23187775","type":"journal-article","created":{"date-parts":[[2023,9,11]],"date-time":"2023-09-11T10:42:49Z","timestamp":1694428969000},"page":"7775","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PSBF: p-adic Integer Scalable Bloom Filter"],"prefix":"10.3390","volume":"23","author":[{"given":"Wenlong","family":"Yi","sequence":"first","affiliation":[{"name":"School of Software, Jiangxi Agricultural University, Nanchang 330045, China"}]},{"given":"Chuang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Agricultural University, Nanchang 330045, China"}]},{"given":"Qiliang","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Agricultural University, Nanchang 330045, China"}]},{"given":"Yingding","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Agricultural University, Nanchang 330045, China"}]},{"given":"Jing","family":"Jia","sequence":"additional","affiliation":[{"name":"School of Software, Jiangxi Agricultural University, Nanchang 330045, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,9,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2338","DOI":"10.1109\/TII.2018.2850053","article-title":"Fuzzy-folded bloom filter-as-a-service for big data storage in the cloud","volume":"15","author":"Singh","year":"2018","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.future.2017.12.016","article-title":"Bloom filter based optimization scheme for massive data handling in IoT environment","volume":"82","author":"Singh","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1049\/cje.2020.02.015","article-title":"Secure data transfer and deletion from counting bloom filter in cloud computing","volume":"29","author":"Yang","year":"2020","journal-title":"Chin. J. Electron."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1109\/COMST.2018.2889329","article-title":"Optimizing bloom filter: Challenges, solutions, and comparisons","volume":"21","author":"Luo","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"6681","DOI":"10.1007\/s10586-018-2403-9","article-title":"Bloom-filter-based request node collaboration caching for named data networking","volume":"22","author":"Hou","year":"2019","journal-title":"Clust. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/MWC.001.2000329","article-title":"Security and privacy for mobile edge caching: Challenges and solutions","volume":"28","author":"Ni","year":"2020","journal-title":"IEEE Wirel. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"4462","DOI":"10.1109\/TNSM.2021.3096428","article-title":"FASE: Fine-grained accountable and space-efficient access control for multimedia content with in-network caching","volume":"18","author":"He","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2674","DOI":"10.1109\/TNET.2022.3177282","article-title":"False negative awareness in indicator-based caching systems","volume":"30","author":"Cohen","year":"2022","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1262","DOI":"10.1049\/cmu2.12621","article-title":"Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management","volume":"17","author":"Zhang","year":"2023","journal-title":"IET Commun."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"103306","DOI":"10.1016\/j.ipm.2023.103306","article-title":"Double locality sensitive hashing Bloom filter for high-dimensional streaming anomaly detection","volume":"60","author":"Zeng","year":"2023","journal-title":"Inf. Process. Manag."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4560","DOI":"10.1093\/bioinformatics\/btz273","article-title":"Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers","volume":"35","author":"Liu","year":"2019","journal-title":"Bioinformatics"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.ins.2020.05.135","article-title":"Passdb: A password database with strict privacy protocol using 3d bloom filter","volume":"539","author":"Patgiri","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_13","first-page":"1928","article-title":"Learned FBF: Learning-Based Functional Bloom Filter for Key\u2013Value Storage","volume":"71","author":"Byun","year":"2021","journal-title":"IEEE Trans. Comput."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"vbac029","DOI":"10.1093\/bioadv\/vbac029","article-title":"Kmtricks: Efficient and flexible construction of bloom filters for large sequencing data collections","volume":"2","author":"Lemane","year":"2022","journal-title":"Bioinform. Adv."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Liang, Y., Ma, J., Miao, Y., Kuang, D., Meng, X., and Deng, R.H. (2023). Privacy-Preserving Bloom Filter-Based Keyword Search over Large Encrypted Cloud Data. IEEE Trans. Comput.","DOI":"10.1109\/TC.2023.3285103"},{"key":"ref_16","unstructured":"Yi, W., Gerasimov, I., Kuzmin, S., and He, H. (2017, January 24\u201326). A stream processing approach to distance measurement of integers in p-adic metric space. Proceedings of the 2017 XX IEEE International Conference on Soft Computing and Measurements (SCM), Saint Petersburg, Russia."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ipl.2006.10.007","article-title":"Scalable bloom filters","volume":"101","author":"Almeida","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TKDE.2009.57","article-title":"The dynamic bloom filters","volume":"22","author":"Guo","year":"2009","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Patgiri, R., Borgohain, S.K., and Bhattacharjee, A. (2018, January 22\u201323). rFilter: A scalable and space-efficient membership filter. Proceedings of the 2018 5th International Conference on Signal Processing and Integrated Networks (SPIN), Noida, India.","DOI":"10.1109\/SPIN.2018.8474044"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3675","DOI":"10.1007\/s00521-019-04397-1","article-title":"Autoscaling bloom filter: Controlling trade-off between true and false positives","volume":"32","author":"Kleyko","year":"2020","journal-title":"Neural Comput. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Kim, M.-K., and Kim, S.-R. (2020, January 13\u201316). Modifications using Circular Shift for a Better Bloom Filter. Proceedings of the International Conference on Research in Adaptive and Convergent Systems, Gwangju, Korea.","DOI":"10.1145\/3400286.3418232"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Rottenstreich, O., Reviriego, P., Porat, E., and Muthukrishnan, S. (2020, January 3). Constructions and applications for accurate counting of the bloom filter false positive free zone. Proceedings of the Symposium on SDN Research, San Jose, CA, USA.","DOI":"10.1145\/3373360.3380845"},{"key":"ref_23","unstructured":"Nayak, S., and Patgiri, R. (2021). robustBF: A high accuracy and memory efficient 2d bloom filter. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.jnca.2019.03.004","article-title":"rDBF: A r-dimensional bloom filter for massive scale membership query","volume":"136","author":"Patgiri","year":"2019","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3589285","article-title":"InfiniFilter: Expanding Filters to Infinity and Beyond","volume":"1","author":"Dayan","year":"2023","journal-title":"Proc. ACM Manag. Data"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Johnson, R., Kuszmaul, B.C., Medjedovic, D., Montes, P., Shetty, P., Spillane, R.P., and Zadok, E. (2011, January 14). Don\u2019t thrash: How to cache your hash on flash. Proceedings of the 3rd Workshop on Hot Topics in Storage and File Systems (HotStorage 11), Portland, OR, USA.","DOI":"10.14778\/2350229.2350275"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Cohen, S., and Matias, Y. (2003, January 10\u201312). Spectral Bloom Filters. Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, San Diego, CA, USA.","DOI":"10.1145\/872757.872787"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2334","DOI":"10.1109\/TNSM.2021.3059075","article-title":"Bloom filter with a false positive free zone","volume":"2","author":"Kiss","year":"2021","journal-title":"IEEE Trans. Netw. Serv. Manag."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zhu, X., Zhang, Q., Cheng, T., Liu, L., Zhou, W., and He, J. (2021, January 5\u201310). DLB: Deep Learning Based Load Balancing. Proceedings of the 2021 IEEE 14th International Conference on Cloud Computing (CLOUD), Chicago, IL, USA.","DOI":"10.1109\/CLOUD53861.2021.00083"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Kim, K., Jeong, Y., Lee, Y., and Lee, S. (2019). Analysis of counting bloom filters used for count thresholding. Electronics, 8.","DOI":"10.3390\/electronics8070779"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Saxena, M., Saurabh, P., and Verma, B. (2012, January 25\u201327). A new hashing scheme to overcome the problem of overloading of articles in Usenet. Proceedings of the Advances in Computer Science, Engineering & Applications: Proceedings of the Second International Conference on Computer Science, Engineering and Applications (ICCSEA 2012), New Delhi, India.","DOI":"10.1007\/978-3-642-30157-5_96"},{"key":"ref_32","unstructured":"Bernstein, D.J. (2023, August 07). DJB Hash. Available online: http:\/\/www.partow.net\/programming\/hashfunctions\/#DJBHashFunction."},{"key":"ref_33","first-page":"2650","article-title":"High-Parallelism Hash-Merge Architecture for Accelerating Join Operation on FPGA","volume":"68","author":"Wu","year":"2021","journal-title":"IEEE Trans. Circuits Syst. II: Express Briefs"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1007\/s12652-020-02873-4","article-title":"A characteristic standardization method for circuit input vectors based on Hash algorithm","volume":"13","author":"Shi","year":"2022","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"ref_35","first-page":"4385","article-title":"Hash table based word searching algorithm","volume":"3","author":"Jain","year":"2012","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"14999","DOI":"10.1007\/s10489-022-04274-w","article-title":"Learning hash index based on a shallow autoencoder","volume":"53","author":"Lin","year":"2023","journal-title":"Appl. Intell."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Trimoska, M., Ionica, S., and Dequen, G. (2021). Time-memory analysis of parallel collision search algorithms. IACR Trans. Cryptogr. Hardw. Embed. Syst., 254\u2013274.","DOI":"10.46586\/tches.v2021.i2.254-274"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/18\/7775\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:48:01Z","timestamp":1760129281000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/18\/7775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,9]]},"references-count":37,"journal-issue":{"issue":"18","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["s23187775"],"URL":"https:\/\/doi.org\/10.3390\/s23187775","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2023,9,9]]}}}