A Crash Recovery Scheme for a Memory-Resident Database System
IEEE Transactions on ComputersPublished 1 September 1986
Hagmann
Citations116
SJR quartileQ1
SJR score1.16
SNIP1.61
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This correspondence presents a method of performing crash recovery for database systems designed to provide fast transaction processing, to effectively use multiple processors, and to perform a fast restart after a crash.
Abstract
Database systems normally have been designed with the assumption that main memory is too small to hold the entire database. With the decreasing cost and increasing performance of semiconductor memories, future database systems may be constructed that keep most or all of the data for the database in main memory. The challenge in the design of these systems is to provide fast transaction processing, to effectively use multiple processors, and to perform a fast restart after a crash. This correspondence presents a method of performing crash recovery for these systems.
Keywords
Computer Science
Foundations of database design/Foundations of database design seriesIntroduction to Database Systems
3,542 Citations2006
Readers of this book will gain a strong working knowledge of the overall structure, concepts, and objectives of database systems and will become familiar with the theoretical principles underlying the construction of such systems.
Lecture notes in computer scienceNotes on data base operating systems
1,652 Citations1978Jim Gray
This paper is a compendium of data base management operating systems folklore and focuses on particular issues unique to the transaction management component especially locking and recovery.
ACM Computing SurveysPrinciples of transaction-oriented database recovery
1,212 Citations1983Theo Haerder, Andreas Reuter
A terminological framework is provided for describing different transactionoriented recovery schemes for database systems in a conceptual rather than an implementation-dependent way by introducing the terms materialized database, propagation strategy, and checkpoint, and a means for classifying arbitrary implementations from a unified viewpoint.
Implementation techniques for main memory database systems
817 Citations1984David J. DeWitt, Randy H. Katz +4 more
This paper considers the changes necessary to permit a relational database system to take advantage of large amounts of main memory, and evaluates AVL vs B+-tree access methods, hash-based query processing strategies vs sort-merge, and study recovery issues when most or all of the database fits in main memory.
ACM Transactions on Database SystemsImplementing a relational database by means of specialzed hardware
254 Citations1979E. Babb
New hardware is described which allows the rapid execution of queries demanding the joining of physically stored relations, with the main feature of the hardware being a special store which can rapidly remember or recall data.
IEEE Transactions on ComputersDirect—A Multiprocessor Organization for Supporting Relational Database Management Systems
220 Citations1979De Witt
ACM Computing SurveysRecovery Techniques for Database Systems
169 Citations1978Joost Verhofstad
A survey of techniques and tools used in filing systems, database systems, and operating systems for recovery, backing out, restart, the mamtenance of consistency, and for the provismn of crash resistance is given.
IEEE Transactions on ComputersA Massive Memory Machine
83 Citations1984Garcia-Molina, Lipton +1 more
The case for a computer with massive amounts of primary storage, on the order of tens of billions of bytes, can outperform all other super-computers on memory bound computations, and a novel architecture for such a machine is presented.
DIRECT - a multiprocessor organization for supporting relational data base management systems
66 Citations1978David J. DeWitt
The design of DIRECT, a multiprocessor organization for supporting relational data base management systems is presented, which has a MIMD (multiple instruction stream, multiple data stream) architecture and can simultaneously support both intra-query and inter-query concurrency.
Communications of the ACMThe TWA reservation system
50 Citations1984David K. Gifford, Alfred Z. Spector
Design decisions for the intelligent database machine
41 Citations1980Robert S. Epstein, Paula Hawthorn
It is contention that the designers of a database machine must choose a focus for their machine which strongly influences other design decisions, and the reasons for this choice are presented.
A processor for a high-performance personal computer
41 Citations1998Butler Lampson, Kenneth A. Pier
The design goals, micro- architecture, and implementation of the microprogrammed processor for a compact high performance personal computer, which supports a range of high level language environments and high bandwidth I/O devices.
A processor for a high-performance personal computer
34 Citations1980Butler Lampson, Kenneth A. Pier
This paper describes the design goals, micro- architecture, and implementation of the microprogrammed processor for a compact high performance personal computer, which supports a range of high level language environments and high bandwidth I/O devices.
Dynamic database dumping
28 Citations1978Daniel J. Rosenkrantz
Several methods are studied for dynamically creating a dump copy of a database while the database is on-line and being updated by user transactions to understand the performance tradeoffs between alternate methods.
Communications of the ACMAudit trail compaction for database recovery
14 Citations1984John Kaunitz, Louis van Ekert
Total elapsed recovery time from disk-based database corruption can be shortened by reprocessing the audit trail off-line and thereby avoiding excessive resource utilization penalties.