Distributed Archival Access Technology Based on Erasable Bloom Filters
1. School of Computer Science, Sichuan Normal University, Chengdu 610101, China
2. School of Physics and Electronic Engineering, Sichuan Normal University, Chengdu 610101, China
| Abstract: | In the current big data environment, the scale of electronic archive data is increasing, due to its dispersion in different regions and systems, its dispersion has led to a sharp increase in the time cost of cross-domain access, and the misjudgment rate continues to rise under high concurrency conditions, which directly affects the accuracy and efficiency of electronic archive information retrieval. In order to solve the above problems, a cross-domain distributed storage electronic archives access technology model based on counting Bloom filter was proposed to support the accurate and efficient retrieval of cross-domain access to electronic archives. Compared with the traditional Bloom filter, the countable bloom filter significantly reduces the memory space consumption under the premise of ensuring the time complexity, and its key feature is that it can not only check the existence of elements, but also record the number of visits to the elements, and support dynamic addition and deletion of retrieved elements Reduce the false positive rate and improve the accuracy of the query. In order to solve the needs of large-scale data processing, the distributed architecture design is adopted to achieve the goal of decentralized server pressure and improve the overall response speed of the system. At the same time, the introduction of Zookeeper ensures the high availability of the system and ensures the cooperation between all nodes. After testing and practical application, the model can improve the efficiency of the file system, ensure the high availability of the system, and provide users with reliable and efficient electronic file management services. |
| Keywords: | Erasable Bloom Filter; Cross-domain Distributed Storage; Electronic Records Management |
| DOI: | 10.57237/j.cst.2023.04.008 |
View:
Downloads:
Received: 14 November 2023
Accepted: 6 December 2023
Published Online: 27 December 2023
References
| [1] | 雷蒙; 肖文超; 高佳宁; 廖雪花 基于位标识的可擦写高效过滤器算法与实现 [J] 软件导刊, 2022(8): 120-125. |
| [2] | 张镱; 丁帅; 乔庐峰; 陈庆华; 刘熹; 邹仕祥 一种基于分段式路由查找的布隆过滤方案 [J], 通信技术, 2022(10): 1300-1306. |
| [3] | 梁静 微服务框架下敏感信息的交叉跨域安全通信技术研究 [D]. 成都: 四川师范大学, 2020. |
| [4] | 安振林; 林琼正; 杨磊; 娄伟; 谢磊 物理层中跨商用RFID的布隆过滤器获取 [J], 计算机网络与通信, 2020, 28(4); 1804-1817. |
| [5] | 王飞越. 基于负载均衡的高效布谷鸟过滤器研究 [D]. 华中科技大学, 2019. |
| [6] | 李云川. 基于深度学习的多键布隆过滤器 [D]. 成都: 电子科技大学, 2023. |
| [7] | 南军虎; 高欢; 汪超群; 一种新型旋流排沙渠道的试验研究和数值模拟 [J]. 2022, 54(6): 116-123. |
| [8] | 卢建元. 高性能哈希技术及其应用的研究 [D]. 北京: 清华大学. |
| [9] | 王乾, 乔庐峰, 陈庆华.可加速最长前缀匹配的布隆过滤查找方案 [J]. 通信技术, 2020, 53(07): 1674-1679. |
| [10] | 孟慧君. 基于Bloom Filter算法的URL去重算法研究及其应用 [D]. 河南大学, 2019. |
| [11] | 耿宏, 李勇猛. 基于分层布隆过滤器的发布订阅自动发现算法 [J]. 计算机工程与设计, 2019, 40(12): 3494-3499. |
| [12] | 华文镝. 基于布谷鸟过滤器的高效近似成员查询结构研[D]. 西宁: 青海师范大学, 2023. |
| [13] | 杨斐. 学习型布隆过滤器优化方法研究与实现 [D]. 合肥:中国科学技术大学, 2023. |
| [14] | 陈乐. 基于分布式集群的高可用日志分析系统的设计 [J]. 中国电子科学研究院学报, 2020(5): 420-426. |
| [15] | 郭晓东. 基于ZooKeeper的计费系统多级故障隔离方案 [J]. 长江信息通信, 2021(10): 186-189. |
| [16] | 程庚. 基于Zookeeper的大数据处理调度系统的设计与实现 [D]. 武汉: 华中科技大学, 2023. |
Join the Editorial Board
We invite active, qualified and high profile scientists and researchers to join as Editorial Board Members.
Join UsBecome a Reviewer
Scholars with a strong interest in reviewing are invited to join the reviewer panel to ensure the quality of the research to be published.
Join Us