Skip Navigation

The Computer Journal 1996 39(5):374-385; doi:10.1093/comjnl/39.5.374
© 1996 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Turkan, Y.
Right arrow Articles by Ulusoy, O.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

An Efficient Memory Management Algorithm for Client–Server Database Management Systems

Y. Turkan * and O. Ulusoy *

Department of Computer Engineering and Information Science, Bilkent University, Bilkent, Ankara 06533, Turkey

Due to the recent improvements in the price/performance characteristics of workstations and the networking capabilities, the client–server system architecture has become a target for database systems. A client–server database management system (DBMS) provides the management of a database that resides on a client–server system. Data-access requests of the clients are handled by the database servers. The whole database is stored on the disks that can be accessed by only the servers, and in order to reduce disk accesses, copies of database items can be cached in the global memory which comprises the memories of all the computers connected to the system. Designing efficient global memory management algorithms helps the transactions experience less disk input/output (I/O) during their execution. In this paper, we propose a global memory management algorithm for client–server DBMSs which aims to reduce disk I/O by increasing the portion of the database available in global memory. Performance of the algorithm is examined by a comparison with some previously proposed algorithms, using a simulation model designed for studying various performance issues in client–server DBMSs. Conditions for which the new algorithm provides significant improvements in the overall throughput of the system are identified.

Received July 26, 1995. revised June 24, 1996.

* Department of Computer Engineering and Information Science, Bilkent University, Bilkent, Ankara 06533, Turkey Email: oulusoy{at}bilkent.edu.tr


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.