Cure: Strong Semantics Meets High Availability and Low Latency

@article{Akkoorath2016CureSS,
  title={Cure: Strong Semantics Meets High Availability and Low Latency},
  author={Deepthi Devaki Akkoorath and Alejandro Z. Tomsic and M. Bravo and Zhongmiao Li and Tyler Crain and Annette Bieniusa and Nuno M. Preguiça and M. Shapiro},
  journal={2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)},
  year={2016},
  pages={405-414}
}
  • Deepthi Devaki Akkoorath, Alejandro Z. Tomsic, +5 authors M. Shapiro
  • Published 2016
  • Computer Science
  • 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS)
  • Developers of cloud-scale applications face a difficult decision of which kind of storage to use, summarised by the CAP theorem. Currently the choice is between classical CP databases, which provide strong guarantees but are slow, expensive, and unavailable under partition, and NoSQL-style AP databases, which are fast and available, but too hard to program against. We present an alternative: Cure provides the highest level of guarantees that remains compatible with availability. These… CONTINUE READING
    88 Citations
    Antidote: the highly-available geo-replicated database with strongest guarantees
    • 4
    • PDF
    Antidote SQL: Relaxed When Possible, Strict When Necessary
    • 5
    • PDF
    Exploring the design space of highly-available distributed transactions
    • 1
    • PDF
    Just-Right Consistency: reconciling availability and safety
    • 8
    • PDF
    Achieving convergent causal consistency and high availability for cloud storage
    • 9
    • Highly Influenced
    • PDF
    A fault-tolerance shim for serverless computing
    • 9
    • PDF
    Consistify: preserving correctness and SLA under weak consistency
    • 2
    IPA: Invariant-preserving Applications for Weakly consistent Replicated Databases
    • 6
    • PDF
    RainbowFS : Modular Consistency and Co-designed Massive File system
    • 2016
    • PDF
    ACGreGate: A Framework for Practical Access Control for Applications using Weakly Consistent Databases
    • PDF

    References

    SHOWING 1-10 OF 51 REFERENCES
    Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
    • 584
    • Highly Influential
    • PDF
    Stronger Semantics for Low-Latency Geo-Replicated Storage
    • 255
    • Highly Influential
    • PDF
    Write Fast, Read in the Past: Causal Consistency for Client-Side Applications
    • 71
    • PDF
    Limitations of Highly-Available Eventually-Consistent Data Stores
    • 56
    • PDF
    Non-Monotonic Snapshot Isolation
    • 14
    • PDF
    Limitations of Highly-Available Eventually-Consistent Data Stores
    • 11
    Highly Available Transactions: Virtues and Limitations
    • 182
    • PDF
    Scalable Atomic Visibility with RAMP Transactions
    • 111
    • PDF
    Conflict-Free Replicated Data Types
    • 603
    • PDF
    A comprehensive study of Convergent and Commutative Replicated Data Types
    • 310
    • PDF