Efficient Update Control of Bloom Filter Replicas in Distributed Systems
نویسنده
چکیده
A standard Bloom filter (BF) (Bloom, 1970) is a lossy but space-efficient data structure to support membership queries within a constant delay. As shown in Figure 1, a BF includes k independent random hash functions and a vector B of a length of m bits. It is assumed that the BF represents a finite set S = {x1, x2,...,xn} of n elements from a universe U . The hash functions hi(x), 1 ≤ i ≤ k, map the universe U to the bit address space [1,m], shown as follows,
منابع مشابه
Data Caching in Ad Hoc Networks using Bloom Filters
Data caching provides efficient data access by maintaining replicas of data in strategic parts of the network. However, current research in this area does not manage memory space of each node efficiently. We propose an improvement by considering Bloom filters, a fast, spaceefficient probabilistic method for looking up data. We compare the system the system performance with and without Bloom fil...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملThe Replica Location Service: Design and Experience
We describe the implementation and evaluate the performance of a Replica Location Service that is part of the Globus Toolkit Versions 3.0 and 4.0. A Replica Location Service (RLS) provides a mechanism for registering the existence of replicas and discovering them. Features of our implementation include the use of soft state update protocols to populate a distributed index and optional Bloom fil...
متن کاملThe Cuckoo Filter: It’s Better Than Bloom
Approximate set-membership tests, exemplified by Bloom filters [1], have numerous applications in networking and distributed systems. A Bloom filter is a compact data structure to quickly answer if a given item is in a set with some small false positive probability ε . Due to its simplicity and high space efficiency, Bloom filters become widely used in network traffic measurement, packet routin...
متن کاملDynamic Replica Control Based on Fairly Assigned Variation of Data for Loosely Coupled Distributed Database Systems
This paper proposes a decentralized and asynchronous replica control method based on a fair assignment of the variation in numerical data that has weak consistency for loosely coupled database systems managed or used by different organizations of human activity. Our method eliminates the asynchronous abort of already committed transactions even if replicas in all network partitions continue to ...
متن کامل