SmartKV: A cost-effective and low-latency geo-distributed key-value store for the computing continuum
Juan Aznar-Poveda, Maximilian Franz Ebner, Thomas Fahringer, Zahra Najafabadi Samani, Marlon Etheredge, Stefan Pedratscher, Nishant Saurabh · Future Generation Computer Systems · 2025
Many data-intensive and distributed applications rely on low-latency and scalable key–value storage systems across the Computing Continuum. Key–value storage systems typically use consistent hashing or hash slot-sharding mechanisms to distribute data across storage nodes, which ensures load balancing but often leads to sub-optimal response times and monetary costs, particularly in geo-distributed systems where nodes might have different unit prices and be widely dispersed. In this paper, we propose SmartKV , a cost-efficient geo-distributed key–value store that optimizes data placement dynamically, abstracting the intricacies of data organization, transfer, access, and processing. SmartKV integrates a decentralized data placement algorithm that optimizes the replication factor and selects suitable locations for key–value pairs and replicas, balancing cost and access latency while keeping optimization overhead low. We employ a realistic cost model based on public and private Cloud and Edge providers that consider data transfer, request, and storage costs. In addition to conventional key–value pairs, SmartKV supports active key–value pairs, which enable the definition of custom data types and the execution of user-defined functions directly on the storage side. This contributes to reducing data transfer costs and round-trip times. We thoroughly evaluate SmartKV across different regions of the Chameleon testbed using several realistic workloads. Results show that the utilized decentralized data placement strategy allows SmartKV to reduce round trip times between 9 and 84% while reducing costs up to 4.84 × under different client workloads and consistency models compared to state-of-the-art data placement strategies. • Novel geo-distributed KV store with custom data placement strategies. • Decentralized data placement algorithm to optimize costs and round trip times. • Active KV pairs support remote execution to reduce costs and round trip times.