Skip to main content
Article thumbnail
Location of Repository

Bloom Filters and Their Properties

By Tomáš Prokop


A dissertation is engaged in a description and a construction of the Bloom filter. The inventor of this filter is Burton H. Bloom. The Bloom filter represents an efficient tool for storing elements into the universal aggregate in the form of a data structure. It processes large volume of data while filling less of store space. The data structure makes it possible to insert elements and their time after time selecting in the aggregate with zero probability of errors. Part of the dissertation is explanation of properties and usage methods of the data structure including possibility of a reduction acceptable errors. An expansion of the Bloom filter is computed Bloom filter, which allows broader usage of the data structure

Topics: bitové pole; liblary; Python; bit array; Počítaný Bloomův filtr; Counting Bloom filters; knihovna; Bloomův filtr; hash funcions; Linux; hashovací funkce; Bloom filters
Publisher: Vysoké učení technické v Brně. Fakulta informačních technologií
Year: 2010
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.