{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-fast-minimal-memory-consistent-hash","title":"A Fast, Minimal Memory, Consistent Hash Algorithm","arxiv_id":"1406.2294","date":"2014-06-09","proceeding":null,"authors":["John Lamping","Eric Veach"],"abstract":"We present jump consistent hash, a fast, minimal memory, consistent hash algorithm that can be expressed in about 5 lines of code. In comparison to the algorithm of Karger et al., jump consistent hash requires no storage, is faster, and does a better job of evenly dividing the key space among the buckets and of evenly dividing the workload when the number of buckets changes. Its main limitation is that the buckets must be numbered sequentially, which makes it more suitable for data storage applications than for distributed web caching.","url_abs":"http://arxiv.org/abs/1406.2294v1","url_pdf":"http://arxiv.org/pdf/1406.2294v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/MadhavJivrajani/go-jump-consistent-hash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/MnO2/jump-consistent-hash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/alextanhongpin/go-jump","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/c9s/jchash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/datadog/fliphash-rs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/dynatrace-oss/hash4j","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/ericherman/libjumphash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/gsharma/consistent-hash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/jjneely/statsrelay","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/ko-han/python-ctools","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/lithammer/go-jump-consistent-hash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/lithammer/python-jump-consistent-hash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/subspace/jump-consistent-hash","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-minimal-memory-consistent-hash","repo_url":"https://github.com/ubitech/generic-policy-engine-with-consistent-hashing","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}