Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore

Persistence and Node FailureRecovery in Strongly Consistent Key-Value Datastore

Consistency preservation of replicated data is a critical aspect for distributed databaseswhich are strongly consistent. Further, in fail-recovery model each process also needs todeal with the management of stable storage and amnesia [1]. CATS is a key/value datastore which combines the Distributed...

Full description

Bibliographic Details
Main Author: Ehsan ul Haque, Muhammad
Format: Others
Language:English
Published: KTH, Skolan för informations- och kommunikationsteknik (ICT) 2012
Subjects:
Datastore
Distributed Hash Table (DHT)
Atomic Shared Registers
Disk Storage
Consistency
Failure Recovery
Paxos
Group Membership
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121281

Internet

http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121281

Similar Items