A Distributed Storage Model for EHR Based on HBase

Author(s):  
Yang Jin ◽  
Tang Deyu ◽  
Zhou Yi
2017 ◽  
Vol 73 ◽  
pp. 13-21 ◽  
Author(s):  
Jianjiang Li ◽  
Peng Zhang ◽  
Yuance Li ◽  
Wei Chen ◽  
Yajun Liu ◽  
...  

Author(s):  
QU Ming-Cheng ◽  
WU Xiang-Hu ◽  
Yang Xiao-Zong

<p>Creation of multi-copies accelerates data transmission and reduces network traffic, but it causes overhead storage and additional network traffic. A variety of parallel transmission algorithms based on GridFTP and multi-copy can be used to accelerate data transmission further, but they can not adapt to a wide range of network, and they can not be used to solve the problems of storage space and network traffic waste. GridTorrent combined with BitTorrent and GridFTP has compatibility with grid and has flexible scalability, but the speed is very slow when there are few peers, to solve this problem multicopy is needed also. To achieve multiple optimization objectives of storage space saving, suitable for two kinds of application modes(i.e. parallel transfer based on GridFTP and BitTorrent), adaptability for wide range of network and higher performance when there are fewer peers, based on the idea of GridTorrent, a distributed storage model, parallel transfer algorithm and virtual peer strategy are proposed. In experiments the performance is compared among the verification system VPG-Torrent and original parallel transfer algorithm<br />(DCDA) only based on GridfTP &amp; multi-copy and GridTorrent. When the same amount of data is deployed VPG-Torrent has better performance than DCDA, and when there are fewer peers VPG-Torrent also exceed GridTorrent, which prove the effectiveness of VPG-Torrent.</p>


2010 ◽  
Vol 20-23 ◽  
pp. 52-57
Author(s):  
Zheng Chen ◽  
Xiao Jing Wang

We provide a prototype system for a distributed storage model, the goal of this system is to store information in a p2p network of n nodes, and the original information could be recovered later in a computationally simple way from (1+e)k of nodes for some small e>0. For solving this problem, we employ a class of B-J codes with dimension 2 as base code and obtain a new class of LDPC code by using q-tuples to substitute the elements of , to modify and improve Raptor code. The improved Raptor Code has many advantages such as high decoding rate, flexibility in choices of the code length and rate of. As the benefits of the above characters, the storage system based on modified Raptor code has great improvement in decoding probability and parameter flexibility, and a simulation is also illustrated to prove our assumption.


Sign in / Sign up

Export Citation Format

Share Document