![]() | This article is rated Stub-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||
|
![]() | This article links to one or more target anchors that no longer exist.
Please help fix the broken anchors. You can remove this template after fixing the problems. |
Reporting errors |
I am after reading this article unable to code a consistent hash. I therefore argue it has failed to explain the core concept involved; the article has only described its functionality. Toby Douglass ( talk) 22:48, 5 July 2012 (UTC)
I might be the only one but I find the notation for the number of keys and for the number of nodes confusing. I know it is the first letter of each word but usually is used for the number of partitions and for the total number of elements and therefore considered . I think it should either be or changed to . I wanted to have some opinions before doing this correction. Cmolter ( talk) —Preceding undated comment added 16:40, 15 July 2013 (UTC)
There is an alternative algorithm for consistent hashing that is shorter, and that is much more efficient when there is a large numbers of servers. The open source Guava hashing library contributed by Google contains an implementation. See consistentHash() here: https://code.google.com/p/guava-libraries/source/browse/guava/src/com/google/common/hash/Hashing.java
That code doesn't have an explanation of the algorithm, but a preprint now gives one: http://arxiv.org/ftp/arxiv/papers/1406/1406.2294.pdf
As an author of that preprint, it is not appropriate for me to edit this page, but it seems like appropriate subject matter for this page. Johnlamping ( talk) 05:02, 13 June 2014 (UTC)
"Since each bucket is associated with many pseudo-randomly distributed points, the resources that were held by that bucket will now map to many different buckets."
"Since each bucket is associated with many pseudo-randomly distributed points, the resources that were held by that bucket will now map to many different buckets."
209.49.110.163 ( talk) 21:45, 20 August 2014 (UTC)
"then walks around the circle until falling into the first bucket it encounters (or equivalently, the first available bucket with a higher angle). The result is that each bucket contains all the resources located between its point and the previous bucket point. — Preceding unsigned comment added by 50.158.132.159 ( talk) 17:54, 8 February 2015 (UTC)
Jungleh ( talk) 09:40, 9 October 2016 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on Consistent hashing. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018.
After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than
regular verification using the archive tool instructions below. Editors
have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
RfC before doing mass systematic removals. This message is updated dynamically through the template {{
source check}}
(last update: 5 June 2024).
Cheers.— InternetArchiveBot ( Report bug) 10:03, 12 August 2017 (UTC)
A citation needed tag was added to the claim of rendezvous hashing being first invented in 1996. A reference is present on the appropriate page and has hence been removed from this page. AB1908 ( talk) 06:09, 16 April 2020 (UTC)
This article was the subject of an educational assignment at College Of Engineering Pune supported by
Wikipedia Ambassadors through the
India Education Program during the 2011 Q3 term. Further details are available
on the course page.
The above message was substituted from {{IEP assignment}}
by
PrimeBOT (
talk) on
20:09, 1 February 2023 (UTC)
I'm confused a bit about the following statement:
"The central idea is, we use a hash function that randomly maps both the BLOB and servers to a unit circle, usually radians. For example, (where is hash of a BLOB or server's identifier, like IP address or UUID)."
I was under the impression that a hash function is deterministic so I'm not sure how it would randomly map... Grossb1 ( talk) 19:41, 27 July 2023 (UTC)
![]() | This article is rated Stub-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||
|
![]() | This article links to one or more target anchors that no longer exist.
Please help fix the broken anchors. You can remove this template after fixing the problems. |
Reporting errors |
I am after reading this article unable to code a consistent hash. I therefore argue it has failed to explain the core concept involved; the article has only described its functionality. Toby Douglass ( talk) 22:48, 5 July 2012 (UTC)
I might be the only one but I find the notation for the number of keys and for the number of nodes confusing. I know it is the first letter of each word but usually is used for the number of partitions and for the total number of elements and therefore considered . I think it should either be or changed to . I wanted to have some opinions before doing this correction. Cmolter ( talk) —Preceding undated comment added 16:40, 15 July 2013 (UTC)
There is an alternative algorithm for consistent hashing that is shorter, and that is much more efficient when there is a large numbers of servers. The open source Guava hashing library contributed by Google contains an implementation. See consistentHash() here: https://code.google.com/p/guava-libraries/source/browse/guava/src/com/google/common/hash/Hashing.java
That code doesn't have an explanation of the algorithm, but a preprint now gives one: http://arxiv.org/ftp/arxiv/papers/1406/1406.2294.pdf
As an author of that preprint, it is not appropriate for me to edit this page, but it seems like appropriate subject matter for this page. Johnlamping ( talk) 05:02, 13 June 2014 (UTC)
"Since each bucket is associated with many pseudo-randomly distributed points, the resources that were held by that bucket will now map to many different buckets."
"Since each bucket is associated with many pseudo-randomly distributed points, the resources that were held by that bucket will now map to many different buckets."
209.49.110.163 ( talk) 21:45, 20 August 2014 (UTC)
"then walks around the circle until falling into the first bucket it encounters (or equivalently, the first available bucket with a higher angle). The result is that each bucket contains all the resources located between its point and the previous bucket point. — Preceding unsigned comment added by 50.158.132.159 ( talk) 17:54, 8 February 2015 (UTC)
Jungleh ( talk) 09:40, 9 October 2016 (UTC)
Hello fellow Wikipedians,
I have just modified one external link on Consistent hashing. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
This message was posted before February 2018.
After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than
regular verification using the archive tool instructions below. Editors
have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the
RfC before doing mass systematic removals. This message is updated dynamically through the template {{
source check}}
(last update: 5 June 2024).
Cheers.— InternetArchiveBot ( Report bug) 10:03, 12 August 2017 (UTC)
A citation needed tag was added to the claim of rendezvous hashing being first invented in 1996. A reference is present on the appropriate page and has hence been removed from this page. AB1908 ( talk) 06:09, 16 April 2020 (UTC)
This article was the subject of an educational assignment at College Of Engineering Pune supported by
Wikipedia Ambassadors through the
India Education Program during the 2011 Q3 term. Further details are available
on the course page.
The above message was substituted from {{IEP assignment}}
by
PrimeBOT (
talk) on
20:09, 1 February 2023 (UTC)
I'm confused a bit about the following statement:
"The central idea is, we use a hash function that randomly maps both the BLOB and servers to a unit circle, usually radians. For example, (where is hash of a BLOB or server's identifier, like IP address or UUID)."
I was under the impression that a hash function is deterministic so I'm not sure how it would randomly map... Grossb1 ( talk) 19:41, 27 July 2023 (UTC)