Advertisement

A Time-Cognizant Dynamic Crash Recovery Scheme Suitable for Distributed Real-Time Main Memory Databases

  • Yingyuan Xiao
  • Yunsheng Liu
  • Xiangyang Chen
  • Xiaofeng Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4158)

Abstract

Rapid and efficient recovery in the event of site crash is very important for distributed real-time main memory database system. In this paper, the recovery correctness criteria of distributed real-time main memory databases are first given. Then, a time-cognizant dynamic crash recovery scheme (TCDCRS) based on log is presented. TCDCRS uses nonvolatile RAM as logging store and integrates the properties of partitioned logging, ephemeral logging and real-time logging in order to reduce the logging cost as possible during the normal running. During restart recovery after site crashes, a dynamic recovery method based on the classification recovery strategy, which supports concurrent of system services and recovery processing, is adopted to decrease the downtime to the most extent. Experiments and evaluations show that TCDCRS has better performances than traditional recovery schemes in two aspects: the missing deadlines ratio of transactions and the time of system denying services after crashes.

Keywords

Recovery Scheme Data Class Earliest Deadline First Database Machine Transaction Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Sivasankaran, R.M., Stankovic, K., Stankovic, J., et al.: Data placement, logging and recovery in real-time active database. In: International Workshop on Active and Real-time Database Systems (June 1995)Google Scholar
  2. 2.
    Lam, K.Y., Kuo, T.W.: Real-time database architecture and techniques, 1st edn. Kluwer Academic Publishers, Boston (2001)MATHGoogle Scholar
  3. 3.
    Agrawal, R., Jagadish, H.V.: Recovery algorithms for database machines with non-volatile memory. In: Boral, H., Faudemay, P. (eds.) IWDM 1989. LNCS, vol. 368. Springer, Heidelberg (1989)Google Scholar
  4. 4.
    Liu, P., Ammann, P., Jajodia, S.: Rewriting histories: Recovering from malicious transactions. Distributed and Parallel Databases 8(1), 7–40 (2000)CrossRefGoogle Scholar
  5. 5.
    Panda, B., Tripathy, S.: Data dependency based logging for defensive information warfare. In: Proceedings of the 2000 ACM symposium on Applied computing, pp. 361–365 (2000)Google Scholar
  6. 6.
    Shu, L.C., Sun, H.M., Kuo, T.W.: Shadowing-based crash recovery schemes for real-time database systems. In: Proceedings of the 11th Euromicro Conference on Real-time Systems, pp. 260–267 (June 1999)Google Scholar
  7. 7.
    ying-yuan, X., yun-sheng, L., hua-feng, D., et al.: One-phase real-time commitment for distributed real-time transactions. Journal of Huazhong University of Science and Technology (Nature Science Edition) 34(3), 1–4 (2006) (in Chinese)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yingyuan Xiao
    • 1
  • Yunsheng Liu
    • 2
  • Xiangyang Chen
    • 3
  • Xiaofeng Liu
    • 2
  1. 1.Department of Computer Science and EngineeringTianjin University of TechnologyTianjinP.R. China
  2. 2.Software CollegeHuazhong University of Science and TechnologyWuhan, HubeiP.R. China
  3. 3.School of Computer Science and EngineeringWuhan Institute of TechnologyWuhan, HubeiP.R. China

Personalised recommendations