Abstract
This paper firstly analyzes the algorithm of extension inquires based on traditionally relational database communication social network data, Then analyzes some shortcomings, and puts forward problems need to be solved. This paper presents design thought based on Hadoop Map/Reduce function model .Combining with the original Map/Reduce programming model and the actual demand of visualization systems, designs extension query algorithm based on Hadoop platform and proves that the algorithm has improved more efficiency in data query than the traditional expansion inquire algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dean, J., Ghemawat, S.: Map/Reduce : Simplified Data Processing 011 Large Clusters. In: OSDI 2004: Sixth Symposium on Operating System Design and Implementation (2004)
Chang, F., Dean, J.: Bigtable: A Distributed Storage System for Structured Data. OSDI (2006)
Orossman, R., Gu, Y.: Data mining using high performance data clounds: experimental studies using sector and sphere. In: Conference Oil Knowledge Discovery in Data, USA (2008)
Liu, J.: Social Network Analysis Introduction. Social Science Literature Press, Peking (2004)
Zhu, Z.: Mass Data Processing Research and Practice Based on the Hadoop [Degree Thesis]. Peking. Beijing Post and Human (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jun, L. (2011). Design of Distributed Communications Data Query Algorithm Based on the Cloud Computing of Hadoop. In: Lin, S., Huang, X. (eds) Advanced Research on Computer Education, Simulation and Modeling. CESM 2011. Communications in Computer and Information Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21802-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-21802-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21801-9
Online ISBN: 978-3-642-21802-6
eBook Packages: Computer ScienceComputer Science (R0)