SWORD: workload-aware data placement and replica selection for cloud data management systems

KA Kumar, A Quamar, A Deshpande, S Khuller - The VLDB Journal, 2014 - Springer
Cloud computing is increasingly being seen as a way to reduce infrastructure costs and add
elasticity, and is being used by a wide range of organizations. Cloud data management …

An efficient data location protocol for self. organizing storage clusters

H Tang, T Yang - Proceedings of the 2003 ACM/IEEE conference on …, 2003 - dl.acm.org
Component additions and failures are common for large-scale storage clusters in production
environments. To improve availability and manageability, we investigate and compare data …

Towards efficient location and placement of dynamic replicas for geo-distributed data stores

P Matri, A Costan, G Antoniu, J Montes… - Proceedings of the ACM …, 2016 - dl.acm.org
Large-scale scientific experiments increasingly rely on geo-distributed clouds to serve
relevant data to scientists worldwide with minimal latency. State-of-the-art caching systems …

A machine learning assisted data placement mechanism for hybrid storage systems

J Ren, X Chen, D Liu, Y Tan, M Duan, R Li… - Journal of Systems …, 2021 - Elsevier
Emerging applications produce massive files that show different properties in file size,
lifetime, and read/write frequency. Existing hybrid storage systems place these files onto …

Location, location, location! modeling data proximity in the cloud

B Tiwana, M Balakrishnan, MK Aguilera… - Proceedings of the 9th …, 2010 - dl.acm.org
Cloud applications have increasingly come to rely on distributed storage systems that hide
the complexity of handling network and node failures behind simple, data-centric interfaces …

Coupling decentralized key-value stores with erasure coding

L Cheng, Y Hu, PPC Lee - Proceedings of the ACM Symposium on …, 2019 - dl.acm.org
Modern decentralized key-value stores often replicate and distribute data via consistent
hashing for availability and scalability. Compared to replication, erasure coding is a …

[PDF][PDF] Robust and efficient data management for a distributed hash table

J Cates - 2003 - dspace.mit.edu
This thesis presents a new design and implementation of the DHash distributed hash table
based on erasure encoding. This design is both more robust and more efficient than the …

Distributed replica placement algorithms for correlated data

M Tu, IL Yen - The Journal of Supercomputing, 2014 - Springer
In distributed systems, data may be correlated due to accesses from clients and the
correlation has some impact on date placement, and existing research works focus on …

Location-aware associated data placement for geo-distributed data-intensive applications

B Yu, J Pan - 2015 IEEE Conference on Computer …, 2015 - ieeexplore.ieee.org
Data-intensive applications need to address the problem of how to properly place the set of
data items to distributed storage nodes. Traditional techniques use the hashing method to …

Elastic consistent hashing for distributed storage systems

W Xie, Y Chen - 2017 IEEE International Parallel and …, 2017 - ieeexplore.ieee.org
Elastic distributed storage systems have been increasingly studied in recent years because
power consumption has become a major problem in data centers. Much progress has been …