DocumentCode
244737
Title
On the False Positive Rate of the Bloom Filter in Case of Using Multiple Hash Functions
Author
Jihong Kim
Author_Institution
Dept. of Inf. & Technol., Semyung Univ., Jecheon, South Korea
fYear
2014
fDate
3-5 Sept. 2014
Firstpage
26
Lastpage
30
Abstract
A Bloom filter is a simple space-efficient randomized data structure used to represent set in order to support membership queries. So it is very useful to search the wanted data from the all entries. In this paper, we analyze the probability of the false positive rate of the Bloom filter used in various applications up to now and present the revised false positive rate of Bloom filter.
Keywords
data structures; probability; query processing; Bloom filter; data search; false positive rate probability; membership queries; multiple hash functions; space-efficient randomized data structure; Data structures; Educational institutions; Equations; Information filters; Matched filters; Upper bound; Bloom filter; False Positive; True Negative;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Security (ASIA JCIS), 2014 Ninth Asia Joint Conference on
Conference_Location
Wuhan
Type
conf
DOI
10.1109/AsiaJCIS.2014.32
Filename
7023235
Link To Document