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

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.
Type de document :
Communication dans un congrès
ESA 2018 - 26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. 43, pp.1 - 43, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. 〈10.4230/LIPIcs.ESA.2018.43〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01964721
Contributeur : Marie-France Sagot <>
Soumis le : dimanche 23 décembre 2018 - 12:58:42
Dernière modification le : jeudi 7 février 2019 - 15:36:53

Fichier

LIPIcs-ESA-2018-43.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Roberto Grossi, Luca Versari. Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables. ESA 2018 - 26th Annual European Symposium on Algorithms, Aug 2018, Helsinki, Finland. 43, pp.1 - 43, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. 〈10.4230/LIPIcs.ESA.2018.43〉. 〈hal-01964721〉

Partager

Métriques

Consultations de la notice

6

Téléchargements de fichiers

92