Atomic commitment in transactional DHTs
Number of Authors: 2
2007 (English)In: Towards Next Generation Grids, Springer , 2007, 1, , 11 p.Conference paper (Refereed)
We investigate the problem of atomic commit in transactional database systems built on top of Distributed Hash Tables. DHTs provide a decentralized way to store and look up data. To solve the atomic commit problem we propose to use an adaption of Paxos commit as a non-blocking algorithm. We exploit the symmetric replication technique existing in the DKS DHT to determine which nodes are necessary to execute the commit algorithm. By doing so we achieve a lower number of communication rounds and a reduction of meta-data in contrast to traditional Three-Phase-Commit protocols. We also show how the proposed solution can cope with dynamism due to churn in DHTs. Our solution works correctly relying only on an inaccurate failure detection of node failure which is necessary for systems running over the Internet.
Place, publisher, year, edition, pages
Springer , 2007, 1. , 11 p.
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22920DOI: 10.1007/978-0-387-72498-0_14ISBN: 978-0-387-72497-3 (print)OAI: oai:DiVA.org:ri-22920DiVA: diva2:1042485
Towards Next Generation Grids: Proceedings of the CoreGRID Symposium 2007