DSMC: A Novel Distributed Store-Retrieve Approach of Internet Data Using MapReduce Model and Community Detection in Big Data

The processing of big data is a hotspot in the scientific research. Data on the Internet is very large and also very important for the scientific researchers, so the capture and store of Internet data is a priority among priorities. The traditional single-host web spider and data store approaches have some problems such as low efficiency and large memory requirement, so this paper proposes a big data store-retrieve approach DSMC (distributed store-retrieve approach using MapReduce model and community detection) based on distributed processing. Firstly, the distributed capture method using MapReduce to deduplicate big data is presented. Secondly, the storage optimization method is put forward; it uses the hash functions with light-weight characteristics and the community detection to address the storage structure and solve the data retrieval problems. DSMC has achieved the high performance of large web data comparison and storage and gets the efficient data retrieval at the same time. The experimental results show that, in the Cloudsim platform, comparing with the traditional web spider, the proposed DSMC approach shows better efficiency and performance.

[1]  Rajkumar Buyya,et al.  CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms , 2011, Softw. Pract. Exp..

[2]  Domenico Talia,et al.  A Divise Initialisation Method for Clustering Algorithms , 1999, PKDD.

[3]  Valentin Müller,et al.  Mathematic model of three-phase induction machine connected to advanced inverter for traction system for electric trolley , 2013 .

[4]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[5]  Di Jin,et al.  Extending a configuration model to find communities in complex networks , 2013 .

[6]  Dayou Liu,et al.  A Markov random walk under constraint for discovering overlapping communities in complex networks , 2011, ArXiv.

[7]  Jin-Soo Kim,et al.  Large-scale incremental processing with MapReduce , 2014, Future Gener. Comput. Syst..

[8]  P. Hansen,et al.  Column generation algorithms for exact modularity maximization in networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Jianwu Li,et al.  Community detection in complex networks using extended compact genetic algorithm , 2012, Soft Computing.

[10]  Tarun Goyal,et al.  Cloudsim: simulator for cloud computing infrastructure and modeling , 2012 .

[11]  Pedro Isasi Viñuela,et al.  Performance of the most common non‐cryptographic hash functions , 2014, Softw. Pract. Exp..

[12]  P. Hansen,et al.  Locally optimal heuristic for modularity maximization of networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Yannis Tzitzikas,et al.  Scalable entity-based summarization of web search results using MapReduce , 2014, Distributed and Parallel Databases.

[14]  Ying Liu,et al.  Network Community Structure Detection for Directional Neural Networks Inferred From Multichannel Multisubject EEG Data , 2014, IEEE Transactions on Biomedical Engineering.

[15]  David A. Bader,et al.  Graph Partitioning and Graph Clustering , 2013 .

[16]  Gaochao Xu,et al.  HMDC: Live Virtual Machine Migration Based on Hybrid Memory Copy and Delta Compression , 2013 .

[17]  Yves Lechevallier,et al.  DIVCLUS-T: A monothetic divisive hierarchical clustering method , 2007, Comput. Stat. Data Anal..

[18]  A Mathematic Model for Calculating Urban Heat Island Intensity Using Mobile Survey Data , 2014 .

[19]  J. Rasson,et al.  The Last Step of a New Divisive Monothetic Clustering Method: the Gluing-Back Criterion , 2004 .

[20]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[21]  Pierre Hansen,et al.  Modularity maximization in networks by variable neighborhood search , 2011, Graph Partitioning and Graph Clustering.

[22]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[23]  Steven P Gross,et al.  Modularity optimization by conformational space annealing. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[25]  Yang Yang,et al.  Methods to find community based on edge centrality , 2013 .

[26]  Ling Chen,et al.  Anti-modularity and anti-community detecting in complex networks , 2014, Inf. Sci..

[27]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[28]  Man Xu,et al.  New approach to eliminate structural redundancy in case resource pools using α mutual information , 2013 .

[29]  Randy H. Katz,et al.  A view of cloud computing , 2010, CACM.

[30]  Jia-Jin Le,et al.  Dynamic Mining Hierarchical Topic from Web News Stream Data Using Divisive-Agglomerative Clustering Method , 2005, PAKDD.

[31]  Gaochao Xu,et al.  A Novel Artificial Bee Colony Approach of Live Virtual Machine Migration Policy Using Bayes Theorem , 2013, TheScientificWorldJournal.

[32]  Gaochao Xu,et al.  A Location Selection Policy of Live Virtual Machine Migration for Power Saving and Load Balancing , 2013, TheScientificWorldJournal.

[33]  Ludo Waltman,et al.  A smart local moving algorithm for large-scale modularity-based community detection , 2013, The European Physical Journal B.

[34]  Peng Gang Sun,et al.  Closed walks for community detection , 2014 .

[35]  Jie Liu,et al.  Novel heuristic density-based method for community detection in networks , 2014 .