kBF: A Bloom Filter for key-value storage with an application on approximate state machines

@article{Xiong2014kBFAB,
  title={kBF: A Bloom Filter for key-value storage with an application on approximate state machines},
  author={Sisi Xiong and Yanjun Yao and Qing Cao and Tian He},
  journal={IEEE INFOCOM 2014 - IEEE Conference on Computer Communications},
  year={2014},
  pages={1150-1158}
}
Key-value (k-v) storage has been used as a crucial component for many network applications, such as social networks, online retailing, and cloud computing. Such storage usually provides support for operations on key-value pairs, and can be stored in memory to speed up responses to queries. So far, existing methods have been deterministic: they will faithfully return previously inserted key-value pairs. Providing such accuracy, however, comes at the cost of memory and CPU time. In contrast, in… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

The Bloom Paradox: When Not to Use a Bloom Filter

IEEE/ACM Transactions on Networking • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…