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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 32; číslo 4; s. 815 - 829
Hlavní autoři:	Ouyang, Lingzhi, Huang, Yu, Wei, Hengfeng, Lu, Jian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.04.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!