In this paper, we present LU-Logging, an efficient transaction recovery method. The method is based on flexible-redo/minimal-undo algorithm. The paper describes an implementation which avoids the overheads of deferred updating used in previous no-undo implementations. An update by a transaction to a data record does not immediately update the data record. Instead, it generates a redo log record and associates it with the data page. Each page in the data base has an associated log page, which contains the still-uncommitted log records of the updates for the data page. The log page is read from and written to the disk along with the corresponding data page. This gives the flexibility of applying the redo log records any time after the transac...
Nowadays, due to the increased user requirements of the fast and reliable data management operation ...
This paper presents an efficient, writer-based logging scheme for recoverable distributed shared mem...
Abstract. In this paper we present new concurrent and re-coverable B-link-tree algorithms. Unlike pr...
In this paper, we present LU-Logging, an efficient transaction recovery method. The method is base...
Techniques similar to shadow pages have been suggested for use in rollback and crash recovery for ne...
Transient versioning methods, which maintain prior record versions temporarily, have been proposed t...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
The proliferation of inexpensive workstations and networks has created a new era in distributed comp...
as exemplified by systems like ARIES, has been the gold standard for relational database recovery. I...
A new method for redo logging and recovery is described. It is designed to work in a data sharing sy...
Data recovery for malicious committed transactions af-ter attacks increasingly becomes an important ...
We develop new algorithms for the management of transactions in a page-shipping client-server databa...
this paper we will use this case to illustrate our logging model. However, the general treatment of ...
Data recovery techniques for malicious transactions are increasingly becoming an important issue sin...
Nowadays, due to the increased user requirements of the fast and reliable data management operation ...
This paper presents an efficient, writer-based logging scheme for recoverable distributed shared mem...
Abstract. In this paper we present new concurrent and re-coverable B-link-tree algorithms. Unlike pr...
In this paper, we present LU-Logging, an efficient transaction recovery method. The method is base...
Techniques similar to shadow pages have been suggested for use in rollback and crash recovery for ne...
Transient versioning methods, which maintain prior record versions temporarily, have been proposed t...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
In this paper we present a simple and efficient method, called ARIES ( Algorithm for Recouery and Is...
The proliferation of inexpensive workstations and networks has created a new era in distributed comp...
as exemplified by systems like ARIES, has been the gold standard for relational database recovery. I...
A new method for redo logging and recovery is described. It is designed to work in a data sharing sy...
Data recovery for malicious committed transactions af-ter attacks increasingly becomes an important ...
We develop new algorithms for the management of transactions in a page-shipping client-server databa...
this paper we will use this case to illustrate our logging model. However, the general treatment of ...
Data recovery techniques for malicious transactions are increasingly becoming an important issue sin...
Nowadays, due to the increased user requirements of the fast and reliable data management operation ...
This paper presents an efficient, writer-based logging scheme for recoverable distributed shared mem...
Abstract. In this paper we present new concurrent and re-coverable B-link-tree algorithms. Unlike pr...