A BETTER WAY FOR FINDING THE OPTIMAL NUMBER OF NODES IN A DISTRIBUTED DATABASE MANAGEMENT SYSTEM

dc.contributor.authorMustafa, Rashed
dc.contributor.authorHossain, Md. Javed
dc.contributor.authorChowdhury, Thomas
dc.date.accessioned2012-11-10T04:46:01Z
dc.date.accessioned2019-05-28T09:49:47Z
dc.date.available2012-11-10T04:46:01Z
dc.date.available2019-05-28T09:49:47Z
dc.date.issued2009-07-01
dc.description.abstractDistributed 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.
dc.identifier.otherhttp://dspace.daffodilvarsity.edu.bd:8080/handle/20.500.11948/490
dc.identifier.urihttp://hdl.handle.net/20.500.11948/490
dc.language.isoen
dc.publisherDaffodil International University
dc.sourceDIU Institutional Repository
dc.subjectDDBMS, Data Fragmentation, Linear Search, RMI.
dc.titleA BETTER WAY FOR FINDING THE OPTIMAL NUMBER OF NODES IN A DISTRIBUTED DATABASE MANAGEMENT SYSTEM
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
A better way for finding the optimal number.pdf.txt
Size:
12.05 KB
Format:
Adobe Portable Document Format