DocumentCode :
3268418
Title :
Main memory database recovery algorithms and their performance
Author :
Kumar, Vijay ; Burger, Albert
Author_Institution :
Comput. Sci. Telecommun., Missouri Univ., Kansas City, MO, USA
fYear :
1990
fDate :
9-13 Dec 1990
Firstpage :
152
Lastpage :
155
Abstract :
In main memory systems recovery becomes more complex mainly due to the volatility of main memory and the elimination of the separation of data storage (disk) and data processing locations (main memory). In a disk based database system, it is the disk copy that represents the stable database restored after a system failure; but in MDBSs, the main memory copy of the database must be recovered. The paper discusses the recovery issues in MDBSs and presents a somewhat detailed performance study of two recovery algorithms, one using a shadow approach and the other update-in-place
Keywords :
database theory; distributed databases; relational databases; system recovery; MDBSs; data processing locations; data storage; disk based database system; disk copy; main memory; performance; recovery algorithms; shadow; stable database; system failure; systems recovery; update-in-place; Checkpointing; Cities and towns; Computer science; Data processing; Database systems; Nonvolatile memory; Partitioning algorithms; Shadow mapping; System recovery; Transaction databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2087-0
Type :
conf
DOI :
10.1109/SPDP.1990.143524
Filename :
143524
Link To Document :
بازگشت