2026-07-22T07:05:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9506 2024-03-06T10:43:55Z ddc:004 open_access

Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables Grossi, Roberto Versari, Luca consistent hashing external memory hash tables 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Roberto Grossi and Luca Versari 2018 Is Part Of LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2018.43 urn:nbn:de:0030-drops-95062 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.43 eng https://creativecommons.org/licenses/by/3.0/legalcode