Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Marie-France Sagot Connect in order to contact the contributor
Submitted on : Sunday, December 23, 2018 - 12:58:42 PM
Last modification on : Tuesday, February 26, 2019 - 10:54:02 AM
Long-term archiving on: : Sunday, March 24, 2019 - 12:54:39 PM


Files produced by the author(s)




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. pp.1 - 43, ⟨10.4230/LIPIcs.ESA.2018.43⟩. ⟨hal-01964721⟩



Record views


Files downloads