Research and optimization of the Bloom filter algorithm in Hadoop
作者： Bing Dong
DOI:
关键词: Big data 、 Computer science 、 Bloom filter 、 Database 、 Data warehouse 、 Data mining
摘要: An increasing number of enterprises have the need transferring data from a traditional database to cloud-computing system. Big in Teradata (a warehouse) often needs be transferred ...
参考文章(7)
Michael Mitzenmacher, John Byers, Jeffrey Considine, Fast Approximate Reconciliation of Set Differences Boston University Computer Science Department. ,(2002)
Magnus Skjegstad, Torleiv Maseng, Low complexity set reconciliation using Bloom filters Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing - FOMC '11. pp. 33- 41 ,(2011) , 10.1145/1998476.1998483
Andrei Broder, Michael Mitzenmacher, Network Applications of Bloom Filters: A Survey Internet Mathematics. ,vol. 1, pp. 485- 509 ,(2004) , 10.1080/15427951.2004.10129096
Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors Communications of the ACM. ,vol. 13, pp. 422- 426 ,(1970) , 10.1145/362686.362692
Jim Wyllie, SPsort: How to Sort a Terabyte Quickly ,(1999)
Jeffrey Dean, Sanjay Ghemawat, MapReduce Communications of the ACM. ,vol. 51, pp. 107- 113 ,(2008) , 10.1145/1327452.1327492
Li Xiang, Analysis of Cloud Computing Infrastructure Based on Hadoop Computer Era. ,(2011)