Achieving Probabilistic Atomicity With Well-Bounded Staleness and Low Read Latency in Distributed Datastores

Although it has been commercially successful to deploy weakly consistent but highly-responsive distributed datastores, the tension between developing complex applications and obtaining only weak consistency guarantees becomes more and more severe. The almost strong consistency tradeoff aims at achie...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 32; H. 4; S. 815 - 829
Hauptverfasser:	Ouyang, Lingzhi, Huang, Yu, Wei, Hengfeng, Lu, Jian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Collaboration Consistency Distributed databases fast read algorithm Heuristic algorithms History Probabilistic atomicity Probabilistic logic quorum-replicated datastore Registers Servers Staling Statistical analysis Storage systems Tradeoffs well-bounded staleness
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!