2 citations · 4 across the 5 of their papers we have counts for
6 papers
NCC: Natural Concurrency Control for Strictly Serializable Datastores by Avoiding the Timestamp-Inversion Pitfall
Haonan Lu, Shuai Mu, Siddhartha Sen +1
Strictly serializable datastores greatly simplify the development of correct applications by providing strong consistency guarantees. However, existing techniques pay unnecessary c…
A Learned Cache Eviction Framework with Minimal Overhead
Dongsheng Yang, Daniel S. Berger, Kai Li +1
Recent work shows the effectiveness of Machine Learning (ML) to reduce cache miss ratios by making better eviction decisions than heuristics. However, state-of-the-art ML caches re…
C5: Cloned Concurrency Control that Always Keeps Up
Jeffrey Helt, Abhinav Sharma, Daniel J. Abadi +2
Asynchronously replicated primary-backup databases are commonly deployed to improve availability and offload read-only transactions. To both apply replicated writes from the primar…
Regular Sequential Serializability and Regular Sequential Consistency
Jeffrey Helt, Matthew Burke, Amit Levy +1
Strictly serializable (linearizable) services appear to execute transactions (operations) sequentially, in an order consistent with real time. This restricts a transaction's (opera…
Reducing Storage in Large-Scale Photo Sharing Services using Recompression
Xing Xu, Zahaib Akhtar, Wyatt Lloyd +2
The popularity of photo sharing services has increased dramatically in recent years. Increases in users, quantity of photos, and quality/resolution of photos combined with the user…
SNOW Revisited: Understanding When Ideal READ Transactions Are Possible
Kishori M Konwar, Wyatt Lloyd, Haonan Lu +1
READ transactions that read data distributed across servers dominate the workloads of real-world distributed storage systems. The SNOW Theorem stated that ideal READ transactions t…