Abstract
The research of a comprehensive security system of the high speed rail is extremely important. It has been the primacy in countries having high speed rail or willing to have it. Raw data used for analyzing security features is usually in binary format and its organization is complicated, so unpacking original high speed rail data is particularly important. In terms of unpacking process, we must ensure the accuracy and real-time property. MapReduce technique has gained a lot of attention from the scientific community for its applicability in large parallel data analysis. To process huge volumes of high speed rail data, this paper presents a parallel method based on MapReduce. The experimental results demonstrate that the proposed parallel method may efficiently unpack the large high speed rail datasets.
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
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufman, San Francisco (2006)
White, T.: Hadoop: The Difitive Guide, 1st edn. O’Reilly Media, Inc., Sebastopol (2009)
Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: Proceedings of Operating Systems Design and Implementation (OSDI), San Francisco, CA, pp. 137–150 (2004)
Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. Communications of the ACM 51(1), 107–113 (2008)
Wan, J., Yu, W., Xu, X.: Design and Implement of Distributed Document Clustering Based on MapReduce. In: Proceedings of the Second Symposium International Computer Science and Computational Technology (ISCSCT 2009), Huangshan, P. R. China, December 26-28, pp. 278–280 (2009)
Zhao, W., Ma, H., He, Q.: Parallel K-Means Clustering Based on MapReduce. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) Cloud Computing. LNCS, vol. 5931, pp. 674–679. Springer, Heidelberg (2009)
Xu, H.K.X., Jager, J.: A fast parallel clustering algorithm for large spatial databases. Data Mining and Knowledge Discovery 3, 263–290 (1999)
Ekanayake, J., Pallickara, S., Fox, G.: MapReduce for Data Intensive Scientific Analyses. In: Proceedings of Fourth IEEE International Conference on eScience, Indianapolis, Indiana, USA, pp. 277–284 (2008)
Lv, Z., Hu, Y., Zhong, H., Wu, J., Li, B., Zhao, H.: Parallel K-Means Clustering of Remote Sensing Images Based on MapReduce. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds.) Web Information Systems and Mining. LNCS, vol. 6318, pp. 162–170. Springer, Heidelberg (2010)
Berlinska, J., Drozdowski, M.: Scheduling divisible MapReduce computations. Journal of Parallel and Distributed Computing 71(3), 450–459 (2011)
Hadoop: Open source implementation of MapReduce, http://hadoop.apache.org/mapreduce/
Yahoo developer network, http://developer.yahoo.com/hadoop/tutorial/module4.html#basics
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
Gao, Z., Li, T., Zhang, J., Zhao, C., Wang, Z. (2011). A Parallel Method for Unpacking Original High Speed Rail Data Based on MapReduce. In: Wang, Y., Li, T. (eds) Practical Applications of Intelligent Systems. Advances in Intelligent and Soft Computing, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25658-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-25658-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25657-8
Online ISBN: 978-3-642-25658-5
eBook Packages: EngineeringEngineering (R0)