scholarly journals PEMBANGUNAN PROTOTYPE SISTEM INFORMASI ADMINISTRASI KEPENDUDUKAN BERBASIS DATA TERDISTRIBUSI

2012 ◽  
Vol 6 (1) ◽  
pp. 60
Author(s):  
Adi Wibowo ◽  
Muh. Abdur Rohman ◽  
Beta Noranita ◽  
Djalal Er Riyanto
Keyword(s):  
Data Management ◽  
Demographic Data ◽  
Population Data ◽  
Database Systems ◽  
Distributed Database ◽  
Data Availability ◽  
Network Computer ◽  
Multiple Data ◽  
Distributed Database System ◽  
The Government

Data kependudukan merupakan suatu hal yang harus dikelola oleh pemerintah, baik daerah maupun pusat. Mekanisme pendataan yang disimpan pada masing-masing daerah dan tidak adanya komunikasi yang menyinkronkan data menyebabkan pencatatan ganda NIK. Sistem basis data terdistribusi merupakan kumpulan basis data yang tersebar di dua komputer atau lebih yang terhubung dalam jaringan komputer. Sistem basis data terdistribusi memberikan keuntungan ketersediaan data serta otonomi dalam pengelolaan data pada masing-masing lokal. Metode basis data terdistribusi yang digunakan adalah metode fragmentasi horizontal. Rancangan basis data terdistribusi data kependudukan dapat digunakan untuk mencegah pencatatan ganda NIK. Prototype Sistem Informasi Administrasi Kependudukan Berbasis Data Terdistribusi (SIAK BDT) yang dibuat digunakan untuk melakukan manajemen data kependudukan seperti menambah, mengubah, dan menampilkan data kependudukan dari berbagai lokasi yang berbeda, serta ketersediaan data. Pengujian terhadap prototype SIAK BDT dilakukan dengan metode simulasi. Dari hasil pengujiannya, prototype SIAK BDT mampu melakukan manajemen data penduduk dari berbagai lokasi yang berbeda dan ketersediaan data. Population data is a matter that must be managed should the government, either local or central. Data collection mechanism that is stored in each region and the lack of communication led to record multiple data sync NIK. Distributed database system is a collection of databases that are spread across two or more computers connected in a network computer. Distributed database systems provide the advantage of data availability as well as autonomy in the management of data on each local. Distributed database methods used are horizontal fragmentation method. The design of distributed database population data can be used to prevent double registration of NIK. Prototype of Sistem Informasi Administrasi Kependudukan Berbasis Data Terdistribusi (SIAK BDT) made is used to perform demographic data management such as adding, changing, and displaying population data from a variety of different locations, and availability of data. Prototype testing of SIAK BDT performed by the method of simulation. From the test results, prototype SIAK BDT able to perform data management people from many different locations and availability of data.

Performance Evaluation of Distributed Database Systems

2014 ◽  
Vol 13 (9) ◽  
pp. 4859-4867
Author(s):  
Khaled Saleh Maabreh
Keyword(s):  
Performance Evaluation ◽  
System Performance ◽  
Operation Mode ◽  
Database Systems ◽  
Distributed Database ◽  
Evaluation Study ◽  
Distributed Database Systems ◽  
Different Types ◽  
Distributed Database System ◽  
Distributed Database Management

Distributed database management systems manage a huge amount of data as well as large and increasingly growing number of users through different types of queries. Therefore, efficient methods for accessing these data volumes will be required to provide a high and an acceptable level of system performance.  Data in these systems are varying in terms of types from texts to images, audios and videos that must be available through an optimized level of replication. Distributed database systems have many parameters like data distribution degree, operation mode and the number of sites and replication. These parameters have played a major role in any performance evaluation study. This paper investigates the main parameters that may affect the system performance, which may help with configuring the distributed database system for enhancing the overall system performance.

MULTI-KEY INDEX FOR DISTRIBUTED DATABASE SYSTEM

2005 ◽  
Vol 15 (02) ◽  
pp. 433-438
Author(s):  
MD. SHAZZAD HOSAIN ◽  
MUHAMMAD ABDUL HAKIM NEWTON
Keyword(s):  
Distributed Databases ◽  
Database Systems ◽  
Distributed Database ◽  
Index Model ◽  
Network Bandwidth ◽  
Distributed Database Systems ◽  
Efficient Access ◽  
Distributed Database System ◽  
Bit Vector ◽  
Centralized Database

In this paper we present a multi-key index model that enables us to search a record with more than one attribute values in distributed database systems. Indices provide fast and efficient access of data and so become a major aspect in centralized database systems. Most of the centralized database systems use B + tree or other types of index structures such as bit vector, graph structure, grid file etc. But in distributed database systems no index model is found in the literature. Therefore efficient access is a major problem in distributed databases. Our proposed index model avoids the query-flooding problem of existing system and thus optimizes network bandwidth.

Algorithm Development, Simulation Analysis and Parametric Studies for Data Allocation in Distributed Database Systems

2002 ◽  
pp. 157-189
Author(s):  
Amita Goyal Chin
Keyword(s):  
Simulation Analysis ◽  
Database Systems ◽  
Distributed Database ◽  
Database System ◽  
Data Allocation ◽  
Distributed Database Systems ◽  
Data Reorganization ◽  
Incremental Growth ◽  
Efficient Data ◽  
Distributed Database System

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.

Incremental Data Allocation and Reallocation in Distributed Database Systems

2011 ◽  
pp. 137-160 ◽  
Author(s):  
Amita Goyal Chin
Keyword(s):  
Database Systems ◽  
Distributed Database ◽  
Database System ◽  
Data Allocation ◽  
Distributed Database Systems ◽  
Data Reorganization ◽  
Incremental Growth ◽  
Efficient Data ◽  
Distributed Database System ◽  
Database Servers

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.

A Data Allocation Strategy Algorithm for Large Databases Based on Genetic Algorithm

2011 ◽  
Vol 268-270 ◽  
pp. 898-903
Author(s):  
Xiao Feng Li ◽  
Yuan Xin Tang ◽  
Cui Cui Gong
Keyword(s):  
Computer Network ◽  
Great Influence ◽  
Distributed Database ◽  
Database System ◽  
Data Availability ◽  
Data Allocation ◽  
Large Databases ◽  
System Improvement ◽  
Distributed Database System ◽  
Allocation Strategies

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.

scholarly journals Implementasi Heterogenous Distributed Database System Oracle Xe 10g dan MySQL Rekam Medis Poliklinik UIN Sunan Kalijaga

2016 ◽  
Vol 4 (1) ◽  
pp. 9 ◽  
Author(s):  
Valdi Adrian Abrar ◽  
Moh Didik R. Wahyudi
Keyword(s):  
Information Systems ◽  
Medical Records ◽  
Distributed Database ◽  
Database System ◽  
Data Availability ◽  
Data Synchronization ◽  
Multiple Servers ◽  
Distributed Database System ◽  
Medical Records System ◽  
Automatic Synchronization

Infrastruktur yang biasa digunakan oleh sistem informasi yang ada di Indonesia kebanyakan mempunyai model yang terpusat. Sehingga, jika terjadi masalah pada server seperti server mati atau terjadi kerusakan pada basis data, maka sistem informasi tidak dapat digunakan sampai masalah pada server tersebut teratasi. Untuk mengatasi hal tersebut, sistem replikasi atau duplikasi data pada sistem basis data terdistribusi diharapkan dapat meminimalisir kehilangan data rekam medis sehingga walaupun ada server yang mengalami masalah, maka data tidak akan hilang. Dalam konteks sistem rekam medis di poliklinik UIN Sunan Kalijaga, hal ini bisa menjadi solusi untuk memenuhi aspek ketersediaan data. Sinkronisasi data antara server utama dan replika dapat dilakukan secara otomatis maupun secara manual. Sinkronisasi otomatis dilakukan dengan cara menjalankan baris program secara otomatis dan berkala dengan aturan tertentu. Sinkronisasi manual dijalankan oleh operator dengan menjalankan suatu perintah. Berdasarkan hasil dan pembahasan, diperoleh kesimpulan bahwa implementasi Heterogenous Distributed Database System pada sistem informasi poliklinik dapat mengatasi masalah jika terjadi pada beberapa server dengan cara mengolah dan mendisribusikan data pada server lain yang aktif. Proses replikasi dan sinkronisasi data rekam medis yang dilakukan, ternyata dapat meminimalisir kehilangan data.Infrastructure used by the existing information systems in Indonesia, mostly have a centralized model. Thus, if a problem occurs on the server as the server is dead or there is damage to the database, the system information can not be used until the problem is solved on the server. To overcome this, the system replication or duplication of data in a distributed database system is expected to minimize the loss of medical records so that even if there is a server that has the problem, then the data will not be lost. In the context of medical records system at the clinic UIN Sunan Kalijaga, this could be a solution to meet aspects of data availability. The data synchronization between the primary and replica servers can be done automatically or manually. Automatic synchronization is done by running the program line automatically and periodically with certain rules. Manual synchronization is run by an operator to execute a command. Based on the results and discussion, we concluded that the implementation of heterogenous Distributed Database System on clinic information systems can solve the problem if it occurs on multiple servers by processing and mendisribusikan data on another server that is active. The process of replication and synchronization of medical records that do, it can minimize data loss.

AN OPTIMAL STATIC PESSIMISTIC SCHEME FOR FAULT TOLERANT DISTRIBUTED DATABASE SYSTEMS

1994 ◽  
Vol 01 (03) ◽  
pp. 365-378
Author(s):  
HOANG PHAM ◽  
DAVID POTOSKI
Keyword(s):  
Fault Tolerant ◽  
Database Systems ◽  
Distributed Database ◽  
Optimal Number ◽  
Data Consistency ◽  
Total System ◽  
Distributed Database Systems ◽  
Replication Control ◽  
Distributed Database System ◽  
Quorum Consensus

A distributed database system often replicates data across its servers to provide a fault-resistant application, which maximizes server availability. Various replication control protocols have been developed to ensure data consistency. In this paper, we develop optimal design methods for the quorum-consensus replication protocol, which (1) maximizes availability of the distributed database systems and (2) minimizes the total system cost by calculating the optimal read quorum and the optimal number of system servers. Several numerical examples and applications are provided to illustrate the results.

Sign in / Sign up

Export Citation Format

Share Document