Work

Commitment in a partitioned distributed database

Year: 1988
Type: conference-paper
Abstract: Network partition is among the hardest failure types in a distributed system even if all processors and links are of fail-stop type. We address the transaction commitment problem in a partitioned distributed database. It is assumed that partitions are detectable. The approach taken is conservative - that is, the same transaction cannot be committed by one site and aborted by another.
Language: English
Open Access status: bronze
OpenAlex ID: W4245537257
FWCI:
Cites: 28
Cited by: 2
Related to: 10