A new fragment re-allocation strategy for NoSQL database systems

被引:5
作者
Chen, Zhikun [1 ,2 ]
Yang, Shuqiang [1 ]
Tan, Shuang [1 ]
He, Li [1 ]
Yin, Hong [1 ]
Zhang, Ge [3 ]
机构
[1] Natl Univ Def Technol, Dept Comp Sci, Changsha 410073, Hunan, Peoples R China
[2] Peoples Liberat Army, Unit 91655, Beijing 100036, Peoples R China
[3] Beijing Aeronaut Engn Technol Res Ctr, Beijing 100076, Peoples R China
基金
中国国家自然科学基金;
关键词
fragment allocation; NoSQL database; hypergraph partition; clustering fragments; fragment correlation; ENVIRONMENT;
D O I
10.1007/s11704-014-3480-4
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
NoSQL databases are famed for the characteristics of high scalability, high availability, and high fault-tolerance. So NoSQL databases are used in a lot of applications. The data partitioning strategy and fragment allocation strategy directly affect NoSQL database systems' performance. The data partition strategy of large, global databases is performed by horizontally, vertically partitioning or combination of both. In the general way the system scatters the related fragments as possible to improve operations' parallel degree. But the operations are usually not very complicated in some applications, and an operation may access to more than one fragment. At the same time, those fragments which have to be accessed by an operation may interact with each other. The general allocation strategies will increase system's communication cost during operations execution over sites. In order to improve those applications' performance and enable NoSQL database systems to work efficiently, these applications' fragments have to be allocated in a reasonable way that can reduce the communication cost i.e., to minimize the total volume of data transmitted during operations execution over sites. A strategy of clustering fragments based on hypergraph is proposed, which can cluster fragments which were accessed together in most operations to the same cluster. Themethod uses a weighted hypergraph to represent the fragments' access pattern of operations. A hypergraph partitioning algorithmis used to cluster fragments in our strategy. This method can reduce the amount of sites that an operation has to span. So it can reduce the communication cost over sites. Experimental results confirm that the proposed technique will effectively contribute in solving fragments re-allocation problem in a specific application environment of NoSQL database system.
引用
收藏
页码:111 / 127
页数:17
相关论文
共 35 条
[1]  
Abdalla H. I., 2011, Proceedings of the 2011 Fifth IEEE/FTRA International Conference on Multimedia and Ubiquitous Engineering (MUE 2011), P297, DOI 10.1109/MUE.2011.60
[2]   RECENT DIRECTIONS IN NETLIST PARTITIONING - A SURVEY [J].
ALPERT, CJ ;
KAHNG, AB .
INTEGRATION-THE VLSI JOURNAL, 1995, 19 (1-2) :1-81
[3]  
Amita G.C., 2002, DATA WAREHOUSING WEB, P137, DOI DOI 10.4018/978-1-931777-02-5.CH007
[4]  
[Anonymous], ACM PODC
[5]  
[Anonymous], 2011, FOLLOWING DIGITAL BR
[6]  
[Anonymous], 2011, SEARCH ANAL MAKE SEN
[7]  
[Anonymous], 2011, BIG DATA NEXT FRONTI
[8]  
[Anonymous], 2012, NEW YORK TIMES
[9]   DATA ALLOCATION IN DISTRIBUTED DATABASE-SYSTEMS [J].
APERS, PMG .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 1988, 13 (03) :263-304
[10]  
Bryant Randal E., 2008, Big-data computing: Creating revolutionary breakthroughs in commerce, science, and society, P1