|
|
Bloom Filters and Their Properties
Prokop, Tomáš ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
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.
|
|
|
Implementation of Bloom Filters in FPGA
Matoušek, Denis ; Kaštil, Jan (referee) ; Žádník, Martin (advisor)
The thesis deals with probabilistic data structure Bloom filter and its modifications - counting Bloom filter and multistage filter. The fundamentals of these data structures are explained and the mathematical equations describing their properties including the equation to minimize the false positive rate are shown. Appropriate hash function is chosen considering an implementation on a FPGA chip. Designs of architectures of the hash function and data structures are implemented in VHDL language and their synthesis is done. Its results are discussed considering occupied resources of a FPGA chip, a critical path and maximum frequency.
|
|
|
Implementation of Bloom Filters in FPGA
Matoušek, Denis ; Kaštil, Jan (referee) ; Žádník, Martin (advisor)
The thesis deals with probabilistic data structure Bloom filter and its modifications - counting Bloom filter and multistage filter. The fundamentals of these data structures are explained and the mathematical equations describing their properties including the equation to minimize the false positive rate are shown. Appropriate hash function is chosen considering an implementation on a FPGA chip. Designs of architectures of the hash function and data structures are implemented in VHDL language and their synthesis is done. Its results are discussed considering occupied resources of a FPGA chip, a critical path and maximum frequency.
|
|
|
Bloom Filters and Their Properties
Prokop, Tomáš ; Kajan, Michal (referee) ; Puš, Viktor (advisor)
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.
|
guest ::
