Database Sharding

2015 ◽  
Vol 5 (2) ◽  
pp. 36-52 ◽  
Author(s):  
Sikha Bagui ◽  
Loi Tang Nguyen

In this paper, the authors present an architecture and implementation of a distributed database system using sharding to provide high availability, fault-tolerance, and scalability of large databases in the cloud. Sharding, or horizontal partitioning, is used to disperse the data among the data nodes located on commodity servers for effective management of big data on the cloud.

2017 ◽  
Vol 1 (1) ◽  
pp. 1-4
Author(s):  
Ary Yulianto

  Majelis Pendidikan Dasar dan Menengah Pimpinan Daerah Kabupaten Magelang needs information about the development of the school. The necessary data include data on human resources, asset data and data of their students. At the moment the data is obtained manually by looking to the schools. With the development of information technology is now expected to have a school information system that can provide information quickly and accurately. Data on each school if put into one large server or big data can be used to analyze the data. The purpose of this research is to implement the interconnection of distributed database system using the socket API. It is used to provide master data of all schools under Persyarikatan Muhammadiyah. To support the analysis of the data interconnection of distributed databases, socket API technology is used. With a system like this then the communications database can be connected so that the school's data will be sent directly through the socket API and the data will automatically be processed by the webservice in the server middleware and will be utilized in the next process.


2011 ◽  
Vol 268-270 ◽  
pp. 898-903
Author(s):  
Xiao Feng Li ◽  
Yuan Xin Tang ◽  
Cui Cui Gong

The distributed database system is the product that the database system combines with the computer network system. The data distribution problem has great influence on distributed database application system improvement, data availability, the efficiency and reliability of the distributed database. The allocation strategies in this paper have used some excellent properties in genetic algorithms, including higher parallelism and robustness, the realization of standard way, and to maintain good balance between the depth prior search and breadth prior search, etc, so the allocation strategies in this article's have high execution efficiency, with stronger ability in seeking the best global solution and easy to realize.


1990 ◽  
Vol 5 (4) ◽  
pp. 363-373
Author(s):  
Zhiquan Jin ◽  
Chengfei Liu ◽  
Zhongxiu Sun ◽  
Xiaofang Zhou ◽  
Peipei Chen ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document