Probabilistically bounded staleness for practical partial quorums
Proceedings of the VLDB Endowment
Toward a principled framework for benchmarking consistency
HotDep'12 Proceedings of the Eighth USENIX conference on Hot Topics in System Dependability
Finding the silver lining for data freshness on the cloud: [extended abstract]
Proceedings of the fourth international workshop on Cloud data management
The potential dangers of causal consistency and an explicit solution
Proceedings of the Third ACM Symposium on Cloud Computing
Eventual consistency today: limitations, extensions, and beyond
Communications of the ACM
Eventual Consistency Today: Limitations, Extensions, and Beyond
Queue - Storage
PBS at work: advancing data management with consistency metrics
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
HAT, not CAP: towards highly available transactions
HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems
Replicated data consistency explained through baseball
Communications of the ACM
Archiving the relaxed consistency web
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
LibRe: a consistency protocol for modern storage systems
Proceedings of the 6th ACM India Computing Convention
Eventually consistent: not what you were expecting?
Communications of the ACM
Eventually Consistent: Not What You Were Expecting?
Queue - Performance
Dagstuhl seminar review: consistency in distributed systems
ACM SIGACT News
| Hi-index | 4.15 |
The CAP theorem's impact on modern distributed database system design is more limited than is often perceived. Another tradeoff—between consistency and latency —has had a more direct influence on several well-known DDBSs. A proposed new formulation, PACELC, unifies this tradeoff with CAP.