DSpace Repository
A BETTER WAY FOR FINDING THE OPTIMAL NUMBER OF NODES IN A DISTRIBUTED DATABASE MANAGEMENT SYSTEM
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Mustafa, Rashed | |
| dc.contributor.author | Hossain, Md. Javed | |
| dc.contributor.author | Chowdhury, Thomas | |
| dc.date.accessioned | 2012-11-10T04:46:01Z | |
| dc.date.accessioned | 2019-05-28T09:49:47Z | |
| dc.date.available | 2012-11-10T04:46:01Z | |
| dc.date.available | 2019-05-28T09:49:47Z | |
| dc.date.issued | 2009-07-01 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11948/490 | |
| dc.description.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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Daffodil International University | en_US |
| dc.subject | DDBMS, Data Fragmentation, Linear Search, RMI. | en_US |
| dc.title | A BETTER WAY FOR FINDING THE OPTIMAL NUMBER OF NODES IN A DISTRIBUTED DATABASE MANAGEMENT SYSTEM | en_US |
| dc.type | Article | en_US |
