K-divided bloom filter algorithm and its analysis

Proceedings of Future Generation Communication and Networking, FGCN 2007

Volumn 1, Issue , 2007, Pages 220-224

  Liu, Xiao Guang ^a   Lee, Jun ^a   Wang, Gang ^a   Xie, Guang Jun ^a   Liu, Jing ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS; NETWORK SECURITY;

BIT MATRIXES; BIT VECTOR; BLOOM FILTERS; BLOOM-FILTER ALGORITHMS; DATA SET; DISTRIBUTED SYSTEMS; ERROR RATE; SPACE AND TIME;

DATA STRUCTURES;

EID: 52249085259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/fgcn.2007.157     Document Type: Conference Paper

References (7)

1. Bloom,B.,Space/time tradeoffs in hash coding with allowable errors,Communications of the ACM, 13(7), 1970, pp422-426.
2. Wang, C.Y., Yang , W.P. and Tseng, J.C.R, Random Filter and Its Analysis, International Journal of Computer Mathematics, Vol. 33, 1990,pp181-194
3. th International Conference on Information and Management Science, 2005,pp386-393
4. Li Fan, Pei Cao, J.Almeida, A.Broder., Summary cache: A scalable wide-area web cache sharing protocol, IEEE/ACM transactions on networking, 8(3).2000,pp282-293.
5. Mitzenmacher,M.,Compressed bloom filters, Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC2001),Rhode,Island,2001, pp23-34
6. Cohen,S.,Matias,Y., Spectral bloom filter, In Proc. ACM International Conference on Management of Data(SIGMOD),San Diego, CA,2003,pp241-252
7. Xiao,M.Z,Dai,Y.F.,Li,X.M.,Split Bloom Filter, Acta Electronia Sinica, Vol. 32(2),2004,pp 241-245