scholarly journals Improved big data filtering algorithm based on bloom filter

2020 ◽  
Vol 1629 ◽  
pp. 012026
Author(s):  
Yujie Liang ◽  
Ying Yu ◽  
Wenhao Ouyang
2010 ◽  
Vol 21 (1) ◽  
pp. 107-118
Author(s):  
Ye-Qing YI ◽  
Ya-Ping LIN ◽  
Xiao-Long LI ◽  
Si-Qing YANG ◽  
Zhi-Qiang YOU

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Zhengqing Li ◽  
Jiliang Mu ◽  
Mohammed Basheri ◽  
Hafnida Hasan

Abstract In order to improve the detection and filtering ability for financial data, a data-filtering method based on mathematical probability statistical model, a descriptive statistical analysis model of big data filtering, probability density characteristic statistical design data filtering analysis combined with fuzzy mathematical reasoning, regression analysis according to probability density of financial data distribution, and threshold test and threshold judgment are conducted to realize data filtering. The test results show that the big data filtering and the reliability and convergence of the mathematical model are optimal.


2019 ◽  
Vol 15 (4) ◽  
pp. 2338-2348 ◽  
Author(s):  
Amritpal Singh ◽  
Sahil Garg ◽  
Kuljeet Kaur ◽  
Shalini Batra ◽  
Neeraj Kumar ◽  
...  

2016 ◽  
Vol 142 (3) ◽  
pp. 23-27
Author(s):  
Ritu Jain ◽  
Mukesh Rawat ◽  
Swati Jain

2021 ◽  
Vol 19 (2) ◽  
pp. 1861-1876
Author(s):  
Shuo Qiu ◽  
◽  
Zheng Zhang ◽  
Yanan Liu ◽  
Hao Yan ◽  
...  

<abstract><p>Private Set Intersection (PSI), which is a hot topic in recent years, has been extensively utilized in credit evaluation, medical system and so on. However, with the development of big data era, the existing traditional PSI cannot meet the application requirements in terms of performance and scalability. In this work, we proposed two secure and effective PSI (SE-PSI) protocols on scalable datasets by leveraging deterministic encryption and Bloom Filter. Specially, our first protocol focuses on high efficiency and is secure under a semi-honest server, while the second protocol achieves security on an economic-driven malicious server and hides the set/intersection size to the server. With experimental evaluation, our two protocols need only around 15 and 24 seconds respectively over one million-element datasets. Moreover, as a novelty, a <italic>multi-round</italic> mechanism is proposed for the two protocols to improve the efficiency. The implementation demonstrates that our <italic>two-round</italic> mechanism can enhance efficiency by almost twice than two basic protocols.</p></abstract>


Sign in / Sign up

Export Citation Format

Share Document