Performance of Recovery Algorithms for Centralized Database Management Systems

نویسندگان

  • Vijay Kumar
  • Shawn D. Moe
چکیده

Database Recovery is responsible for preserving the database consistency after a failure of any kind (transaction, system or media). Relevant information solely for recovery is saved in a log during normal transaction processing. To recover from a failure, basically two operations: undo and redo are applied with the help of the log on the last consistent state of the database. These two operations can be combined in four different ways to define four different types of recovery algorithms: "undo-redo", "no undo-redo", "undo-no redo" and "no undo-no redo". Each of these algorithms manages log and updates to the database differently, which affect the overall performance and the availability of the database. To our knowledge, not much work has been done on the performance of recovery algorithms. There are only six reports available and these works have concentrated their studies only on a few algorithms. They have mainly used queuing approach, which we believe is not adequate for a detailed performance study. In this paper we investigate the relative performance of these four algorithms through simulation. The purpose of conducting this study is first to verify the findings of earlier works, and second to obtain a detailed comparison of the behavior of all recovery algorithms. Earlier works . Our simulation studies show that in most cases, undo-redo and no undo-redo deliver similar recovery performance but better than undo-no redo and no undo-no redo. We observe that the recovery times increase with multiprogramming level, but generally decrease as the number of checkpoints increases. The undo-no redo algorithm results in a greater number of transaction rollbacks, which creates a larger transaction log, and thus longer recovery times. Its performance increases against undo-redo and no undo-redo as input/output performance improves. Slow input/output performance is also attributed as the cause of the no undo-no redo algorithm’s poor recovery performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Evaluation of Secure Concurrency Control Algorithm for Multilevel Secure Distributed Database Systems

Majority of the research in multilevel secure database management systems (MLS/DBMS) focuses primarily on centralized database systems. However, with the demand for higher performance and higher availability, database systems have moved from centralized to distributed architectures, and the research in multilevel secure distributed database management systems (MLS/DDBMS) is gaining more and mor...

متن کامل

Checkpointing Schemes for Fast Restart in Main Memory

The potential for substantial performance improvement in a main memory database system (MMDB) is promising, since I/O activity is kept at minimum. On the other hand, due to the volatility of main memory, the issue of failure recovery becomes more complex than in traditional disk resident database systems. In this paper, we present four checkpointing schemes for the MMDB. The proposed schemes ar...

متن کامل

A Simulation Study for Shared-disk Parallel Database Systems Eine Simulationsstudie Zu Parallelen Shared-disk Datenbanksystemen

Shared-disk parallel database systems are one form to exploit parallel architectures for high performance transaction processing. A shared-disk parallel database consists of several processing nodes that are loosely coupled via a communication network and share the common database at the disk level. This thesis provides a comprehensive performance study of shared-disk systems. We have developed...

متن کامل

The Performance of Concurrency Control Algorithms for Database Management Systems

This paper describes a study of the performance of centralized concurrency control algorithms. An algorithm-independent simulation framework was developed in order to support comparative studies of various concurrency control algorithms. We describe this framework in detail and present performance results which were obtained for what we believe to be a representative cross-section of the many p...

متن کامل

Modeling Object Flows from Distributed and Federated RFID Data Streams for Efficient Tracking and Tracing (Supplemental)

If data from different nodes are stored in a centralized database using the schema above, the definitions themselves can answer the queries. Proper indices can improve the performance. However, there are still some significant performance issues in large scale systems such as IoT where the number of nodes and objects could be very large. We discuss below why a centralized solution does not scal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 86  شماره 

صفحات  -

تاریخ انتشار 1995