![]() | This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
I'm not sure I understand the big difference here. Isn't cyclic polynomial just Rabin-Karp with a=2 and xor instead of plus? Perhaps this can be made clearer. —Preceding unsigned comment added by Ketil ( talk • contribs) 12:32, 18 May 2011 (UTC)
Another difference is that the "cyclic polynomial" only works when the number of bits in the lookup table is larger than k (the length of substrings we are interested in.) Thus if we are doing string matching with strings of length 1000 we need to store 1000 bit hash values. Thomasda ( talk) 18:34, 13 April 2021 (UTC)
Why is A(n) computed? It doesn't seem to be used. Only the moving sum S(n) is used. Ligneus ( talk) 22:34, 29 June 2015 (UTC)
Should this page link to implementations at all? The C++ implementation linked in this page has an implementation of Rabin Karp which is not the actual Rabin Fingerprint, but a polynomial that I don't know how to name exactly. I tried to emphasize the difference by adding a section. The point is, I believe it is wrong. I am the author of https://github.com/chmduquesne/rollinghash and I considered linking it, but for the same reason (I could have made a mistake) I did not link it in this page. — Preceding unsigned comment added by Chmduquesne ( talk • contribs) 23:33, 3 February 2018 (UTC)
Why bother? Just use the h() hash directly and xor together. What does adding in shifts gain you? 79.75.102.4 ( talk) 14:24, 10 September 2020 (UTC)
Questioner here again: on reflection, A xor A = 0 which makes it much less useful, so a shift adds reversible extra info which prevents a character cancelling itself out. 85.211.193.117 ( talk) 11:29, 12 September 2020 (UTC)
@ Xyb: This article has a short section about Content-Defined Chunking. Should the section be split into a separate article? Jarble ( talk) 23:44, 20 January 2024 (UTC)
![]() | This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
I'm not sure I understand the big difference here. Isn't cyclic polynomial just Rabin-Karp with a=2 and xor instead of plus? Perhaps this can be made clearer. —Preceding unsigned comment added by Ketil ( talk • contribs) 12:32, 18 May 2011 (UTC)
Another difference is that the "cyclic polynomial" only works when the number of bits in the lookup table is larger than k (the length of substrings we are interested in.) Thus if we are doing string matching with strings of length 1000 we need to store 1000 bit hash values. Thomasda ( talk) 18:34, 13 April 2021 (UTC)
Why is A(n) computed? It doesn't seem to be used. Only the moving sum S(n) is used. Ligneus ( talk) 22:34, 29 June 2015 (UTC)
Should this page link to implementations at all? The C++ implementation linked in this page has an implementation of Rabin Karp which is not the actual Rabin Fingerprint, but a polynomial that I don't know how to name exactly. I tried to emphasize the difference by adding a section. The point is, I believe it is wrong. I am the author of https://github.com/chmduquesne/rollinghash and I considered linking it, but for the same reason (I could have made a mistake) I did not link it in this page. — Preceding unsigned comment added by Chmduquesne ( talk • contribs) 23:33, 3 February 2018 (UTC)
Why bother? Just use the h() hash directly and xor together. What does adding in shifts gain you? 79.75.102.4 ( talk) 14:24, 10 September 2020 (UTC)
Questioner here again: on reflection, A xor A = 0 which makes it much less useful, so a shift adds reversible extra info which prevents a character cancelling itself out. 85.211.193.117 ( talk) 11:29, 12 September 2020 (UTC)
@ Xyb: This article has a short section about Content-Defined Chunking. Should the section be split into a separate article? Jarble ( talk) 23:44, 20 January 2024 (UTC)