MMDB reload algorithms

In a mam memory database (WB), the primary copy of the database may be stored in a volatile memory When a crash occurs, a reload of the database from archive memory to main memory must be performed. It is essential that an efficient reload scheme be used to ensure that the expectations of high performance database systems are met. This implies that the overall performance measures of any potential reload algorithm should not be measured simply by reload time, but by its impact on overall system performance. This paper presents four different reload algorithms that aim at fast response time of transactions and high throughput of the overall system, Simulation studies comparing the algorithms indicate that the best overall approach is one based on frequency of access.

[1]  Tobin Jon Lehman.  Design and performance evaluation of a main memory relational database system (t tree) , 1986 .

[2]  Dieter Gawlick,et al.  Processing "Hot Spots" in High Performance Systems , 1985, COMPCON.

[3]  Hector Garcia-Molina,et al.  Disk striping , 1986, 1986 IEEE Second International Conference on Data Engineering.

[4]  Hector Garcia-Molina,et al.  System M: A Transaction Processing Testbed for Memory Resident Data , 1990, IEEE Trans. Knowl. Data Eng..

[5]  Michael J. Carey,et al.  A recovery algorithm for a high-performance memory-resident database system , 1987, SIGMOD '87.

[6]  Margaret H. Eich,et al.  Main memory database research directions , 1989 .

[7]  Robert B. Hagmann.  A Crash Recovery Scheme for a Memory-Resident Database System , 1986, IEEE Transactions on Computers.

[8]  Michael Stonebraker,et al.  Implementation techniques for main memory database systems , 1984, SIGMOD '84.

[9]  Sang Hyuk Son.  Recovery in main memory database systems for engineering design applications , 1989 .

[10]  Ravi Krishnamurthy,et al.  Design of a Memory Resident DBMS , 1985, IEEE Computer Society International Conference.

[11]  Carl Staelin,et al.  File system design using large memories , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[12]  Dieter Gawlick,et al.  One Thousand Transactions per Second , 1985, COMPCON.

[13]  Le Gruenwald,et al.  Reload in a main memory database system: MARS , 1990, Proceedings of the 1990 Symposium on Applied Computing.

[14]  K. M. Salem.  Failure recovery in memory resident transaction processing systems , 1989 .

[15]  Margaret H. Eich.  Mars: The Design of a Main Memory Database Machine , 1988 .