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.

Data Replication Impact on DDBS System Performance

2019 ◽  
pp. 134-162 ◽  
Author(s):  
Ali A. Amer
Keyword(s):  
System Performance ◽  
Data Distribution ◽  
Evaluation Process ◽  
Data Replication ◽  
Database Systems ◽  
Distributed Database ◽  
Communication Costs ◽  
Distributed Database Systems ◽  
Data Fragmentation ◽  
Heuristic Clustering

In distributed database systems (DDBS), the utmost purpose of data distribution and replication aims at shrinking transmission costs (TC), including communication costs, and response time. In this chapter, therefore, an enhanced heuristic clustering-based technique for data fragmentation and replicated based allocation is efficaciously presented. This work is mainly sought to further enhance an existing technique so TC is to be significantly minimized. In fact, the approached enhancement is applied by suggesting different replication scenarios. Off these scenarios, one scenario is to be selected based on competitive performance evaluation process. DDBS performance is measured via its being exposed on objective function (TC). Despite the fact that this work is mildly improved, yet evaluation results show that it has been promising, particularly as TC being the foremost design objective of DDBS System. Experimental results have been analyzed under all presented scenarios as an internal evaluation and are vividly provided to demonstrate the undeniable impact of data replication on DDBS 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.

scholarly journals Simulation Studies of Distributed Two-phase Locking in Distributed Database Management Systems

2015 ◽  
Vol 13 (1-2) ◽  
pp. 46-55 ◽  
Author(s):  
Svetlana Vasileva ◽  
Aleksandar Milev
Keyword(s):  
Phase Locking ◽  
Database Systems ◽  
Distributed Database ◽  
Simulation Modelling ◽  
Integrated Modelling ◽  
Two Phase ◽  
Distributed Database Systems ◽  
Timestamp Ordering ◽  
Distributed Database Management ◽  
Personal Version

Abstract This paper considers algorithms simulating the implementation of distributed two-phase locking (2PL) protocols in distributed database systems and simulation results. It describes specifically the simulations of two-version 2PL and 2PL with integrated timestamp ordering mechanism. Integrated modelling algorithms for deadlock avoiding are suggested in the paper: twoversion architecture of database and timestamp ordering strategy “wait-die”. The results of the simulations of these two variants of the 2PL method at different scales of the networks for data transmission and at different intensities of inflow transactions are also presented. Modelling algorithms are developed by means of the system for simulation modelling GPSS World Personal Version.

Sign in / Sign up

Export Citation Format

Share Document