Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
A recovery algorithm for a high-performance memory-resident database system
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Crash recovery in client-server EXODUS
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Two-phase commit optimizations in a commercial distributed environment
Distributed and Parallel Databases
Revisiting commit processing in distributed database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
System M: A Transaction Processing Testbed for Memory Resident Data
IEEE Transactions on Knowledge and Data Engineering
Main Memory Database Systems: An Overview
IEEE Transactions on Knowledge and Data Engineering
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Recovering from Main-Memory Lapses
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Distributed real time database systems: background and literature review
Distributed and Parallel Databases
| Hi-index | 0.00 |
Although the distributed database systems has been studyed for a long time, there has been only few commercial systems available. The main reason for this is that the distributed commit processing costs too much which results in little or no performance gain compared with single node database system. In this paper, we note the difference in the update and logging policy between disk based database and main memory database in the distributed environmenty and presents a fast distributed commit protocol for the main memory database. In the proposed protocol, instead of sending and receiving two sets of messages one after the other as in two phase commit, only one set of messages are sent after the coordinator completes committing a distributed transaction. The main idea of this fast commit processing is to send all the redo-logs to the coordinator so that the coordinator alone can make the decision to commit or abort when the time comes. As a result, the frequency of the communication and the disk access related to the commit processing can be significantly reduced. Our simulation study shows that the proposed commit protocol achieves the high performance as we expect.