Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables - Archive ouverte HAL Access content directly
Conference Papers Year :

Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables

(1, 2) , (1)
1
2

Abstract

This paper proposes round-hashing, which is suitable for data storage on distributed servers and for implementing external-memory tables in which each lookup retrieves at most one single block of external memory, using a stash. For data storage, round-hashing is like consistent hashing as it avoids a full rehashing of the keys when new servers are added. Experiments show that the speed to serve requests is tenfold or more than the state of the art. In distributed data storage, this guarantees better throughput for serving requests and, moreover, greatly reduces decision times for which data should move to new servers as rescanning data is much faster.
Fichier principal
Vignette du fichier
LIPIcs-ESA-2018-43.pdf (598.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01964721 , version 1 (23-12-2018)

Identifiers

Cite

Roberto P Grossi, Luca P Versari. Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. ESA 2018 - 26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. pp.1 - 43, ⟨10.4230/LIPIcs.ESA.2018.43⟩. ⟨hal-01964721⟩

Collections

INRIA INRIA2
11 View
127 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More