BIBLIOGRAPHY

Almeida, P

., Baquero, C., Preguica, N., Hutchison, D. 2007. Scalable Bloom Filters; http://gsd.di.uminho.pt/

members/cbm/ps/dbloom.pdf

Bloom, B. 1970. Space/Time Trade-oﬀs in Hash Coding with Allowable Errors; https://www.cs.upc.edu/

~diaz/p422-bloom.pdf

Cormode, G., & Muthukrishnan, S. 2003. An Improved Data Stream Summary: The Count-Min Sketch and its

Applications; http://dimacs.rutgers.edu/~graham/pubs/papers/cm-full.pdf

Deng, F., & Raﬁei, D. 2006. Approximately Detecting Duplicates for Streaming Data using Stable Bloom

Filters; https://webdocs.cs.ualberta.ca/~draﬁei/papers/DupDet06Sigmod.pdf

Flajolet, P

., Fusy, É, Gandouet, O., Meunier, F. 2007. HyperLogLog: The analysis of a near-optimal cardinality

estimation algorithm; http://algo.inria.fr/ﬂajolet/Publications/FlFuGaMe07.pdf

Stranneheim, H., Käller, M., Allander, T., Andersson, B., Arvestad, L., Lundeberg, J. 2010. Classiﬁcation of

DNA sequences using Bloom ﬁlters. Bioinformatics, 26(13); http://bioinformatics.oxfordjournals.org/content/

26/13/1595.full.pdf

Tarkoma, S., Rothenberg, C., & Lagerspetz, E. 2011. Theory and Practice of Bloom Filters for Distributed

Systems. IEEE Communications Surveys & Tutorials, 14(1); https://gnunet.org/sites/default/ﬁles/

TheoryandPracticeBloomFilter2011Tarkoma.pdf

Treat, T. 2015. Stream Processing and Probabilistic Methods: Data at Scale; http://bravenewgeek.com/stream-

processing-and-probabilistic-methods