期刊文献+

A new fragment re-allocation strategy for NoSQL database systems 被引量:3

A new fragment re-allocation strategy for NoSQL database systems
原文传递
导出
摘要 Abstract NoSQL databases are famed for the characteristics of high scalability, high availability, and high faulttolerance. 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 onhypergraph is proposed, which can cluster fragments which were accessed together in most operations to the same cluster. The method uses a weighted hypergraph to represent the fragments' access pattem of operations. A hypergraph partitioning algorithm is 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. Abstract NoSQL databases are famed for the characteristics of high scalability, high availability, and high faulttolerance. 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 onhypergraph is proposed, which can cluster fragments which were accessed together in most operations to the same cluster. The method uses a weighted hypergraph to represent the fragments' access pattem of operations. A hypergraph partitioning algorithm is 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.
出处 《Frontiers of Computer Science》 SCIE EI CSCD 2015年第1期111-127,共17页 中国计算机科学前沿(英文版)
基金 Thanks to the anonymous reviewers for their insightful comments. This work was supported by National High Technology Research and Development Plan of China ("863" plan)(2012AA012600, 2012AA01A402, 2012AA01A401, 2011AA010702 and 2010AA012505) the National Natural Science Foundation of China (Grant Nos. 60933005 and 91124002) the National Key Technology Research and Development Program of China (2012BAH38B04 and 2012BAH38B06) National 242 Information Security Program of China (2011A010).
关键词 fragment allocation NoSQL database hypergraph partition clustering fragments fragment correlation fragment allocation, NoSQL database, hypergraph partition, clustering fragments, fragment correlation
  • 相关文献

参考文献1

二级参考文献18

  • 1IBIBM software strategy group. IBM Google Announcement on Internet-Scale Computing (Cloud Computing Model),2007.
  • 2NiNiu J, Cai K, Gerding E, et al. Characterizing effective auction mechanisms: insights from the 2007 tac market design competition. In: Proceedings of the 7th International Conference on Autonomous Agents and Multiagent Systems, Estoril, 2008.
  • 3ZhZhang Y, Kameda H, Hung S L. Comparison of dynamic and static load-balancing strategies in heterogeneous distributed systems. Comput Digit Tech, 1997, 144: 100-106.
  • 4LiLin H C, Raghavendra C S. A dynamic load-balancing policy with a central job dispatcher (LBC). IEEE Trans Softw Engineer, 1992, 18: 148-158.
  • 5NaNarendran B, Rangarajan S, Yajnik S. Data distribution algorithms for load balanced fault-tolerant web access. In: Proceedings of the 16th Symposium on Reliable Distributed Systems, North Carolina, 1997. 97-106.
  • 6ChChen L C, Choi H A. Approximation algorithms for data distribution with load balancing of web servers. In: Proceedings of IEEE International Conference on Cluster Computing, California, 2001. 274-281.
  • 7TsTse S S. Approximate algorithms for document placement in distributed web servers. IEEE Trans Softw Engineer,2005, 16: 489-496.
  • 8YoYokota H, Kanemasa Y, Miyazaki J. Fat-Btree: An update-conscious parallel directory structure. In: Proceedings of the 15th International Conference on Data Engineering, Sydney, 1999. 448-457.
  • 9LeLee M L, Kitsuregawa M, Ooi B C, et al. Towards self-tuning data placement in parallel database systems. In: Proceedings of SIGMOD Conference, Texas, 2000. 225-236.
  • 10FFeelifl H, Kitsuregawa M, Ooi B C. A fast convergence technique for online heat-balancing of Btree indexed database over shared-nothing parallel systems. In: Proceedings of the 11th International Conference on Database and Expert Systems Applications, London, 2000. 846-858.

共引文献1

同被引文献29

引证文献3

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部