Research and Improvement of Database Storage Method

Article Preview

Abstract:

This paper presents a massive data storage and parallel processing method based on MPP architecture, and put forward full persistent data storage way from the client to request, and the integration the idea of Map/Reduce, the system will be distributed to each data node, the data has high scalability, high availability, high concurrency. And the simulation test and verifies the feasibility of mass data storage mode by building a distributed data node.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

641-645

Citation:

Online since:

October 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Shan Wang, XiaoYong Du, XiaoFeng Meng, Hong Chen. Database Rearch: Achievements and Challenges. J. Comput. Sci. & Technol. Sept. 2006, Val. 21, No. 5: 823-837.

Google Scholar

[2] Jiang Yuming. The study of mass data storage system. Computer knowledge and technology. 2011. 08.

Google Scholar

[3] Cunchen Li, Jun Yang, Jing Han, Haihong E. The Distributed Storage System Based On MPP For Mass Data [C]/ 2012 IEEE Asia-Pacific Services Computing Conference. GuiLin, Guangxi: EEEE, 2012: 384-387.

DOI: 10.1109/apscc.2012.55

Google Scholar

[4] Nancy Lynch and Seth Gilbert. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News, Volume 33 Issue 2 (2002): 51-59.

DOI: 10.1145/564585.564601

Google Scholar