Importance-aware Bloom Filter for managing set membership queries on streaming data

2013 ◽  
Author(s):  
Ravi Bhoraskar ◽  
Vijay Gabale ◽  
Purushottam Kulkarni ◽  
Dhananjay Kulkarni
Keyword(s):  
Bloom Filter ◽  
Streaming Data ◽  
Membership Queries ◽  
Set Membership

A Load Balancing Mechanism Using Bloom Filter in Storm System

2014 ◽  
Vol 543-547 ◽  
pp. 1972-1976
Author(s):  
Huai Lin Dong ◽  
Ming Yuan He ◽  
Qing Feng Wu ◽  
Sheng Hang Wu
Keyword(s):  
Data Structure ◽  
Load Balancing ◽  
Real Time ◽  
Data Transmission ◽  
Streaming Media ◽  
Bloom Filter ◽  
Time System ◽  
Real Time System ◽  
Membership Queries ◽  
Probabilistic Data Structure

When membership queries are evaluated in a set, the performance can be improved by a Bloom filter which is a space-efficient probabilistic data structure. According to its space-efficient character, Bloom Filter presented to address the load balancing problem for streaming media information in Storm system which is free and open source distributed real time computation system. This method increases the server cluster availability by balancing the workloads among the servers within a cluster. Additionally, it improves real time system Storm efficiently in saving the data transmission time and reducing the calculation complexity.

A Scalable Bloom Filter for Membership Queries

2007 ◽  
Author(s):  
Kun Xie ◽  
Yinghua Min ◽  
Dafang Zhang ◽  
Jigang Wen ◽  
Gaogang Xie
Keyword(s):  
Bloom Filter ◽  
Membership Queries

FBF: Bloom Filter for Fuzzy Membership Queries on Strings

2021 ◽  
Author(s):  
Rishabh Kumar ◽  
Hari Prasanna P ◽  
Mukund Rungta ◽  
Swetha Kashinath Phuleker ◽  
Hemant Tiwari ◽  
...  
Keyword(s):  
Bloom Filter ◽  
Fuzzy Membership ◽  
Membership Queries

scholarly journals COUNTING BLOOM FILTER ARCHITECTURE IN VLSI NETWORK SYSTEMS

2015 ◽  
pp. 76-80
Author(s):  
NAGAMALLI. A ◽  
KEDARESWARARAO. M
Keyword(s):  
Bloom Filter ◽  
Embedded Memory ◽  
Network Systems ◽  
False Negatives ◽  
Space Efficiency ◽  
Vlsi Technology ◽  
Set Membership ◽  
Filter Architecture ◽  
Real Time Applications ◽  
Counting Bloom Filter

The Counting Bloom Filter (CBF) is useful for real time applications where the time and space efficiency is the main consideration in performing a set membership tests. The CBF estimates whether an element is present in a large array or not by allowing false positives and by not permitting false negatives. In this paper CBF architecture is analyzed and has been implemented. There are two approaches of CBF, SRAM based approach using up/down counters and the LCBF using up/down LFSR unit. In this paper the LCBF architecture discussed and analyzed. In the latest VLSI technology it is easy to fabricate memories that hold a few million bits of data and addresses. But in the recent embedded memory technologies rather than mapping of addresses of 5000 bits of data using hashing functions we can concise in to single contiguous memory.

Coloring Embedder: Towards Multi-Set Membership Queries in Web Cache Sharing

2021 ◽  
pp. 1-1
Author(s):  
Zhaodong Kang ◽  
Jin Xu ◽  
Wenqi Wang ◽  
Jie Jiang ◽  
Shiqi Jiang ◽  
...  
Keyword(s):  
Membership Queries ◽  
Set Membership ◽  
Web Cache
Sign in / Sign up

Export Citation Format

Share Document