2Goel A,Shahabi C,Yao D S,et at. SCADDAR:An efficient ran- domized technique to reorganize eontinuous media blocks [C] /,/ Proe of the 18th Int Conf on Data Engineering(iCDE 02). Pisea- taway, NJ IEEE, 2002 : 473-482.
3Litwin W, Risch T. LH * g.. a high-availability scalable distribu- ted data structure by record grouping[J]. EEE Transactions on Knowledge and Data Engineering, 2002,14(4):923-927.
4Honicky R J, Miller E L. A fast algorithm for online placement and reorganization of replicated data[C]//Dongarra J, ed. ProC. of the 17th Intl Parallel Distributed Processing Symp. Nice: IEEE Computer Society, 2003.
5Honicky R J, Miller E L. Replication under scalable hashing A family of algorithms for scalable DecentRalized data distribution [C]//Proceedings of the 18th International Pallel &- Distributed Processing Symposium. Santa Fe, NM, 2004.
6Peter S, Gerhard W, Peter Z. Data partitioning and load balan- cing in parallel disk systems[J]. The VLDB Journal, 1998(7) : 48-66.
7潘承洞,潘承彪,等.初等数论(第三版)[M].北京:北京大学出版社,2013.
8Anon. Big data [J]. Nature, 2008, 455: 1-13.
9Gartner.2012年10大战略技术与趋势[J].新闻纵览,2011(11):18.19.
10Anon. Big data [EB/OL ]. [ 2012-10-02]. http ://www.nature.com /news/special/bigdata/index.
