Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
Cache-, Hash- and Space-Efficient Bloom Filters FELIX PUTZE, PETER SANDERS and JOHANNES SINGLER Universit¨at Karlsruhe A Bloom filter is a very compact data structure that supports approximate membership queries on a se
Add to Reading List
Document Date: 2009-03-05 07:21:06
Open Document
File Size: 251,43 KB
Share Result on Facebook
Cache-, Hash- and Space-Efficient Bloom Filters FELIX PUTZE, PETER SANDERS and JOHANNES SINGLER Universit¨at Karlsruhe A Bloom filter is a very compact data structure that supports approximate membership queries on a se