Name
Abstract | ||
|---|---|---|
Modern database systems use transactions to achieve a high degree of fault-tolerance. Many modern programming languages and systems provide garbage collected heap storage, which frees the programmer from the job of explicitly deallocating storage. In this paper we describe integrated garbage collection and recovery algorithms for managing a stable heap in which accessible objects survive both system crashes and media failures.A garbage collector typically both moves and modifies objects which can lead to problems when the heap is stable because a system crash after the start of collection but before enough of the reorganized heap reaches the disk can leave the disk in an inconsistent state. Furthermore, collection has to be coordinated with the recovery system. We present a collection algorithm and recovery system that solves these problems. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1145/67544.66928 | SIGMOD Conference |
Keywords | Field | DocType |
programming language,garbage collection,database system,fault tolerant,garbage collector | Garbage,Manual memory management,Mark-compact algorithm,Computer science,Heap overflow,Heap (data structure),Garbage collection,Garbage in, garbage out,Binomial heap,Database | Conference |
Volume | Issue | ISSN |
18 | 2 | 0163-5808 |
ISBN | Citations | PageRank |
0-89791-317-5 | 17 | 4.45 |
References | Authors | |
21 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elliot K. Kolodner | 1 | 483 | 83.65 |
| Barbara Liskov | 2 | 6025 | 1219.69 |
| William E. Weihl | 3 | 2614 | 903.11 |