A Survey on Bloom Filter for Multiple Sets
Author:
Waikhom Lilapati, Nayak SabuzimaORCID, Patgiri Ripon
Publisher
Springer Singapore
Reference23 articles.
1. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970) 2. Blustein, J., El-Maazawi, A.: Bloom filters. a tutorial, analysis, and survey. Dalhousie University, Halifax, NS, pp. 1–31 (2002) 3. Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) Algorithms—ESA 2006, pp. 684–695. Springer, Berlin Heidelberg, Berlin, Heidelberg (2006) 4. Calderoni, L., Palmieri, P., Maio, D.: Location privacy without mutual trust: the spatial bloom filter. Comput. Commun. 68, 4–16 (2015) 5. Chang, D.C., Chen, C., Thanavel, M.: Dynamic reordering bloom filter. In: 2017 19th Asia-Pacific network operations and management symposium (APNOMS), pp. 288–291. IEEE (2017)
|
|