A distributed data store model satisfying sequential consistency or causal consistency with operation logs

Daisuke Kitao, Daisuke Ikeda

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

A distributed data store can satisfy two properties out of three properties which are (strict) consistency, availability and partition-tolerance. In case of distributed data stores satisfying availability and partition-tolerance, they can satisfy weak consistency, especially causal consistency, which is the strongest consistency that can cohabit with other two properties. Moreover, if any networks between nodes have no problem and very low latency, the distributed data store can satisfy stronger consistency than causal consistency. Sequential consistency is one of the stronger consistency than causal consistency. In order to satisfy sequential consistency, a distributed data store needs to equalize an order of data changing in all nodes. In this paper, we propose distributed data store model containing special nodes "casting nodes" and algorithms in order to decide an order of operations. Thanks to the casting nodes, our model can satisfy sequential consistency when all networks can connect, and our model can satisfy causal consistency when any networks disconnect.

元の言語英語
ホスト出版物のタイトルProceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016
出版者Acta Press
ページ274-280
ページ数7
ISBN(電子版)9780889869790
DOI
出版物ステータス出版済み - 2016
イベント13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016 - Innsbruck, オーストリア
継続期間: 2 15 20162 16 2016

その他

その他13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016
オーストリア
Innsbruck
期間2/15/162/16/16

Fingerprint

Casting
Availability

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

これを引用

Kitao, D., & Ikeda, D. (2016). A distributed data store model satisfying sequential consistency or causal consistency with operation logs. : Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016 (pp. 274-280). Acta Press. https://doi.org/10.2316/P.2016.834-010

A distributed data store model satisfying sequential consistency or causal consistency with operation logs. / Kitao, Daisuke; Ikeda, Daisuke.

Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016. Acta Press, 2016. p. 274-280.

研究成果: 著書/レポートタイプへの貢献会議での発言

Kitao, D & Ikeda, D 2016, A distributed data store model satisfying sequential consistency or causal consistency with operation logs. : Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016. Acta Press, pp. 274-280, 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016, Innsbruck, オーストリア, 2/15/16. https://doi.org/10.2316/P.2016.834-010
Kitao D, Ikeda D. A distributed data store model satisfying sequential consistency or causal consistency with operation logs. : Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016. Acta Press. 2016. p. 274-280 https://doi.org/10.2316/P.2016.834-010
Kitao, Daisuke ; Ikeda, Daisuke. / A distributed data store model satisfying sequential consistency or causal consistency with operation logs. Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016. Acta Press, 2016. pp. 274-280
@inproceedings{5aefbd70f3694685bb9a6cb22d747620,
title = "A distributed data store model satisfying sequential consistency or causal consistency with operation logs",
abstract = "A distributed data store can satisfy two properties out of three properties which are (strict) consistency, availability and partition-tolerance. In case of distributed data stores satisfying availability and partition-tolerance, they can satisfy weak consistency, especially causal consistency, which is the strongest consistency that can cohabit with other two properties. Moreover, if any networks between nodes have no problem and very low latency, the distributed data store can satisfy stronger consistency than causal consistency. Sequential consistency is one of the stronger consistency than causal consistency. In order to satisfy sequential consistency, a distributed data store needs to equalize an order of data changing in all nodes. In this paper, we propose distributed data store model containing special nodes {"}casting nodes{"} and algorithms in order to decide an order of operations. Thanks to the casting nodes, our model can satisfy sequential consistency when all networks can connect, and our model can satisfy causal consistency when any networks disconnect.",
author = "Daisuke Kitao and Daisuke Ikeda",
year = "2016",
doi = "10.2316/P.2016.834-010",
language = "English",
pages = "274--280",
booktitle = "Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016",
publisher = "Acta Press",

}

TY - GEN

T1 - A distributed data store model satisfying sequential consistency or causal consistency with operation logs

AU - Kitao, Daisuke

AU - Ikeda, Daisuke

PY - 2016

Y1 - 2016

N2 - A distributed data store can satisfy two properties out of three properties which are (strict) consistency, availability and partition-tolerance. In case of distributed data stores satisfying availability and partition-tolerance, they can satisfy weak consistency, especially causal consistency, which is the strongest consistency that can cohabit with other two properties. Moreover, if any networks between nodes have no problem and very low latency, the distributed data store can satisfy stronger consistency than causal consistency. Sequential consistency is one of the stronger consistency than causal consistency. In order to satisfy sequential consistency, a distributed data store needs to equalize an order of data changing in all nodes. In this paper, we propose distributed data store model containing special nodes "casting nodes" and algorithms in order to decide an order of operations. Thanks to the casting nodes, our model can satisfy sequential consistency when all networks can connect, and our model can satisfy causal consistency when any networks disconnect.

AB - A distributed data store can satisfy two properties out of three properties which are (strict) consistency, availability and partition-tolerance. In case of distributed data stores satisfying availability and partition-tolerance, they can satisfy weak consistency, especially causal consistency, which is the strongest consistency that can cohabit with other two properties. Moreover, if any networks between nodes have no problem and very low latency, the distributed data store can satisfy stronger consistency than causal consistency. Sequential consistency is one of the stronger consistency than causal consistency. In order to satisfy sequential consistency, a distributed data store needs to equalize an order of data changing in all nodes. In this paper, we propose distributed data store model containing special nodes "casting nodes" and algorithms in order to decide an order of operations. Thanks to the casting nodes, our model can satisfy sequential consistency when all networks can connect, and our model can satisfy causal consistency when any networks disconnect.

UR - http://www.scopus.com/inward/record.url?scp=85015888672&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015888672&partnerID=8YFLogxK

U2 - 10.2316/P.2016.834-010

DO - 10.2316/P.2016.834-010

M3 - Conference contribution

AN - SCOPUS:85015888672

SP - 274

EP - 280

BT - Proceedings of the 13th IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2016

PB - Acta Press

ER -