|
Title:
|
MINIMAL PERFECT HASHING AND BLOOM FILTERS MADE PRACTICAL |
|
Author(s):
|
Fabiano Cupertino Botelho, Wladmir Cardoso Brandão, Nivio Ziviani |
|
ISBN:
|
978-989-8533-06-7 |
|
Editors:
|
Hans Weghorn, Leonardo Azevedo and Pedro Isaías |
|
Year:
|
2011 |
|
Edition:
|
Single |
|
Keywords:
|
Bloom filter, minimal perfect hashing, data structures. |
|
Type:
|
Short Paper |
|
First Page:
|
465 |
|
Last Page:
|
470 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The Bloom filter is a space-efficient data structure for storing an approximation ? to a set such that |
|
|
|
|
|
|
