This report addresses the problem of fault tolerance to system failures for database systems that are to run on highly concurrent computers. It assumes that, in general, an application may have a wide distribution in the lifetimes of its transactions. Logging remains the method of choice for ensuring fault tolerance. Generational garbage collection techniques manage the limited disk space reserved for log information; this technique does not require periodic checkpoints and is well suited for applications with a broad range of transaction lifetimes. An arbitrarily large collection of parallel log streams provide the necessary disk bandwidth
This paper presents an efficient, writer-based logging scheme for recoverable distributed shared mem...
Multi-node systems with coherent memory offer significant performance and programming advantages for...
Multicore in-memory databases for modern machines can support extraordinarily high transaction rates...
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In this paper we present recovery techniques for distributed main-memory databases, specically for c...
The proliferation of inexpensive workstations and networks has created a new era in distributed comp...
A transaction-consistent global checkpoint of a database records a state of the database which refle...
This paper presents an integrated concurrency and recovery algorithm. Strict timestamp ordering was ...
Multicore in-memory databases for modern machines can support extraordinarily high transaction rates...
This paper presents a recovery mechanism for memoryresident databases. It uses some stable memory an...
Large machines with tens or even hundreds of thousands of processors are currently in use. As the nu...
In this paper we present recovery techniques for distributed main-memory databases, specifically for...
A simple model is used to study the effect of fault-tolerance techniques and system design on system...
This paper presents an efficient, writer-based logging scheme for recoverable distributed shared mem...
Multi-node systems with coherent memory offer significant performance and programming advantages for...
Multicore in-memory databases for modern machines can support extraordinarily high transaction rates...
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Com...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
In this paper we present recovery techniques for distributed main-memory databases, specically for c...
The proliferation of inexpensive workstations and networks has created a new era in distributed comp...
A transaction-consistent global checkpoint of a database records a state of the database which refle...
This paper presents an integrated concurrency and recovery algorithm. Strict timestamp ordering was ...
Multicore in-memory databases for modern machines can support extraordinarily high transaction rates...
This paper presents a recovery mechanism for memoryresident databases. It uses some stable memory an...
Large machines with tens or even hundreds of thousands of processors are currently in use. As the nu...
In this paper we present recovery techniques for distributed main-memory databases, specifically for...
A simple model is used to study the effect of fault-tolerance techniques and system design on system...
This paper presents an efficient, writer-based logging scheme for recoverable distributed shared mem...
Multi-node systems with coherent memory offer significant performance and programming advantages for...
Multicore in-memory databases for modern machines can support extraordinarily high transaction rates...