A better way for finding the optimal number of nodes in a distributed database management system

Authors

  • Rashed Mustafa Department of Computer Science and Telecommunication Engineering Noakhali Science and Technology University, Bangladesh
  • Md Javed Hossain Department of Computer Science and Telecommunication Engineering Noakhali Science and Technology University, Bangladesh
  • Thomas Chowdhury Department of Computer Science and Engineering Chittagong University of Engineering and Technology (CUET), Bangladesh

DOI:

https://doi.org/10.3329/diujst.v4i2.4362

Keywords:

DDBMS, Data Fragmentation, Linear Search, RMI

Abstract

Distributed Database Management System (DDBMS) is one of the prime concerns in distributed computing. The driving force of development of DDBMS is the demand of the applications that need to query very large databases (order of terabytes). Traditional Client- Server database systems are too slower to handle such applications. This paper presents a better way to find the optimal number of nodes in a distributed database management systems.

Keywords: DDBMS, Data Fragmentation, Linear Search, RMI.  

DOI: 10.3329/diujst.v4i2.4362

Daffodil International University Journal of Science and Technology Vol.4(2) 2009 pp.19-22

Downloads

Download data is not yet available.
Abstract
243
PDF
159

Downloads

Published

2010-02-10

How to Cite

Mustafa, R., Hossain, M. J., & Chowdhury, T. (2010). A better way for finding the optimal number of nodes in a distributed database management system. Daffodil International University Journal of Science and Technology, 4(2), 19–22. https://doi.org/10.3329/diujst.v4i2.4362

Issue

Section

Papers