Optimal Semijoins for Distributed Database Systems
IEEE Transactions on Software Engineering
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
OceanStore: an architecture for global-scale persistent storage
ACM SIGPLAN Notices
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
An architecture for secure wide-area service discovery
Wireless Networks - Selected Papers from Mobicom'99
IEEE/ACM Transactions on Networking (TON)
R* Optimizer Validation and Performance Evaluation for Distributed Queries
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The Bloomier filter: an efficient data structure for static support lookup tables
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Bringing Efficient Advanced Queries to Distributed Hash Tables
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Self-organization in peer-to-peer systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Fast statistical spam filter by approximate classifications
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Approximately detecting duplicates for streaming data using stable bloom filters
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Beyond bloom filters: from approximate membership checks to approximate state machines
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Building high accuracy bloom filters using partitioned hashing
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
IEEE Transactions on Knowledge and Data Engineering
Modified cuckoo search algorithm for unconstrained optimization problems
ECC'11 Proceedings of the 5th European conference on European computing conference
Optimizing Bloom Filter Settings in Peer-to-Peer Multikeyword Searching
IEEE Transactions on Knowledge and Data Engineering
Bat algorithm: literature review and applications
International Journal of Bio-Inspired Computation
Bio-inspired computation: success and challenges of IJBIC
International Journal of Bio-Inspired Computation
| Hi-index | 0.00 |
Bloom filter (BF) is a simple but powerful data structure that can check membership to a static set. The trade-off to use Bloom filter is a certain configurable risk of false positives. The odds of a false positive can be made very low if the hash bitmap is sufficiently large. Spam is an irrelevant or inappropriate message sent on the internet to a large number of newsgroups or users. A spam word is a list of well-known words that often appear in spam mails. The proposed system of bin Bloom filter (BBF) groups the words into number of bins with different false positive rates based on the weights of the spam words. Cuckoo search (CS) and bat algorithm are bio-inspired algorithms that imitate the way cuckoo breeding and microbat foraging behaviours respectively. This paper demonstrates the CS and bat algorithm for minimising the total membership invalidation cost of the BBFs by finding the optimal false positive rates and number of elements stored in every bin. The experimental results demonstrate the application of CS and bat algorithm for various numbers of bins and strings.