Research on Three-Dimensional Bloom Filter

Author

Wang, Jingzhong ; Du, Fei

Author_Institution

Coll. of Inf. Eng., North China Univ. of Technol., Beijing, China

fYear

2009

fDate

19-20 Dec. 2009

Firstpage

1

Lastpage

4

Abstract

Aiming at the lack of membership classification existed in traditional Bloom algorithm. This paper presented a novel three-dimensional structure Bloom filter of mathematical model, called TBF, which represents a large data set in order to support membership queries and classification. We describe the construction of TBFs, provide an analysis of its false positive probability, time complexity and total query cost, the genetic algorithm is employed to solve the mathematical model, and demonstrate its effectiveness experimentally.

Keywords

computational complexity; data structures; genetic algorithms; pattern classification; probability; 3D structure Bloom filter; false positive probability; genetic algorithm; mathematical model; membership classification; membership querying; time complexity; total query cost; Algorithm design and analysis; Cost function; Databases; Educational institutions; Filtering algorithms; Genetic algorithms; Hydrogen; Information filtering; Information filters; Mathematical model;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Engineering and Computer Science, 2009. ICIECS 2009. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4994-1

Type

conf

DOI

10.1109/ICIECS.2009.5366581

Filename

5366581