Less Hashing, Same Performance: Building a Better Bloom Filter
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- Vol. 33 (2) , 456-467
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Probability and Computing2005
- Bloom Filters in Probabilistic Verification2004
- Fast and Accurate Bitstate Verification for SPINLecture Notes in Computer Science, 2004
- Network Applications of Bloom Filters: A SurveyInternet Mathematics, 2004
- Compressed Bloom filtersIEEE/ACM Transactions on Networking, 2002
- Summary cache: a scalable wide-area Web cache sharing protocolIEEE/ACM Transactions on Networking, 2000
- Balls and bins: A study in negative dependenceRandom Structures & Algorithms, 1998
- A Classical Introduction to Modern Number Theory1990
- Practical performance of Bloom filters and parallel free-text searchingCommunications of the ACM, 1989
- More analysis of double hashing1988