The case for learned index structures
Indexes are models: a\btree-Index can be seen as a model to map a key to the position of a
record within a sorted array, a Hash-Index as a model to map a key to a position of a record …
record within a sorted array, a Hash-Index as a model to map a key to a position of a record …
Cloudburst: Stateful functions-as-a-service
V Sreekanti, C Wu, XC Lin, J Schleier-Smith… - ar** with remote memory accesses. However, state-of …
LITE kernel RDMA support for datacenter applications
Recently, there is an increasing interest in building data-center applications with RDMA
because of its low-latency, high-throughput, and low-CPU-utilization benefits. However …
because of its low-latency, high-throughput, and low-CPU-utilization benefits. However …
Deconstructing {RDMA-enabled} distributed transactions: Hybrid is better!
There is currently an active debate on which RDMA primitive (ie, one-sided or two-sided) is
optimal for distributed transactions. Such a debate has led to a number of optimizations …
optimal for distributed transactions. Such a debate has led to a number of optimizations …