A low-cost multi-failure resilient replication scheme for high-data availability in cloud storage

J Liu, H Shen, H Chi, HS Narman… - IEEE/ACM …, 2020 - ieeexplore.ieee.org
Data availability is one of the most important performance factors in cloud storage systems.
To enhance data availability, replication is a common approach to handle the machine …

AutoPlacer Scalable Self-Tuning Data Placement in Distributed Key-Value Stores

J Paiva, P Ruivo, P Romano, L Rodrigues - ACM Transactions on …, 2014 - dl.acm.org
This article addresses the problem of self-tuning the data placement in replicated key-value
stores. The goal is to automatically optimize replica placement in a way that leverages …

RETRACTED ARTICLE: Building the electronic evidence analysis model based on association rule mining and FP-growth algorithm

Y Wu, J Zhang - Soft Computing, 2020 - Springer
In China's criminal procedure law, electronic data is a kind of independent evidence. With
the development of big data technology, more and more attention has been paid to the …

Want to scale in centralized systems? Think P2P

AM Kermarrec, F Taïani - Journal of Internet Services and Applications, 2015 - Springer
Abstract Peer-to-peer (P2P) systems have been widely researched over the past decade,
leading to highly scalable implementations for a wide range of distributed services and …

A reinforcement learning based data storage and traffic management in information-centric data center networks

W Yang, Y Qin, ZZ Yang - Mobile Networks and Applications, 2022 - Springer
Abstract Data Center Networks (DCN), a core infrastructure of cloud computing, place heavy
demands on efficient storage and management of massive data. The data storage scheme …

{DEPART}: Replica Decoupling for Distributed {Key-Value} Storage

Q Zhang, Y Li, PPC Lee, Y Xu, S Wu - 20th USENIX Conference on File …, 2022 - usenix.org
Modern distributed key-value (KV) stores adopt replication for fault tolerance by distributing
replicas of KV pairs across nodes. However, existing distributed KV stores often manage all …

A data placement strategy based on clustering and consistent hashing algorithm in cloud computing

Q Li, K Wang, S Wei, X Han, L Xu… - … on Communications and …, 2014 - ieeexplore.ieee.org
To reduce time delay of processing data and improve the efficiency of cloud computing, a
clustering algorithm based on the principle of minimum distance is proposed to place user …

On data placement in distributed systems

J Paiva, L Rodrigues - ACM SIGOPS Operating Systems Review, 2015 - dl.acm.org
Data placement refers to the problem of deciding how to assign data items to nodes in a
distributed system to optimize one or several of a number of performance criteria such as …

SDKV: A Smart and Distributed Key-Value Store for the Edge-Cloud Continuum

J Aznar-Poveda, T Pockstaller, T Fahringer… - Proceedings of the …, 2023 - dl.acm.org
Many time-critical and data-intensive distributed applications for the computing continuum
depend on low-latency, scalable, and highly available distributed key value storages. In this …

On the expressiveness and trade-offs of large scale tuple stores

R Vilaça, F Cruz, R Oliveira - On the Move to Meaningful Internet Systems …, 2010 - Springer
Massive-scale distributed computing is a challenge at our doorstep. The current exponential
growth of data calls for massive-scale capabilities of storage and processing. This is being …