Name
Title | ||
|---|---|---|
Enhanced Bloom filter utilisation scheme for string matching using a splitting approach. |
Abstract | ||
|---|---|---|
Bloom filters (BFs) are widely utilised to speed up string matching in crucial network applications such as real-time intrusion detection and spam filters. This study introduces a new approach to improve the efficiency of BFs for string matching functions. The approach splits each target string into two substrings and considers the second substring for programming the BF. The objective is to minim... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1049/iet-com.2017.1093 | IET Communications |
Keywords | Field | DocType |
data structures,security of data,string matching | String searching algorithm,Bloom filter,False positive rate,Substring,Algorithm,Real-time computing,Hash function,Intrusion detection system,Mathematics,Speedup | Journal |
Volume | Issue | ISSN |
12 | 7 | 1751-8628 |
Citations | PageRank | References |
1 | 0.36 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shervin Vakili | 1 | 38 | 4.79 |
| J. M. Pierre Langlois | 2 | 87 | 20.69 |
| Y. Savaria | 3 | 119 | 26.71 |
| Naraig Manjikian | 4 | 112 | 11.99 |