ℹ️ Skipped - page is already crawled
| Filter | Status | Condition | Details |
|---|---|---|---|
| HTTP status | PASS | download_http_code = 200 | HTTP 200 |
| Age cutoff | FAIL | download_stamp > now() - 6 MONTH | 8.9 months ago |
| History drop | PASS | isNull(history_drop_reason) | No drop reason |
| Spam/ban | PASS | fh_dont_index != 1 AND ml_spam_score = 0 | ml_spam_score=0 |
| Canonical | PASS | meta_canonical IS NULL OR = '' OR = src_unparsed | Not set |
| Property | Value |
|---|---|
| URL | https://courses.cs.umbc.edu/341/fall99/frey/Lectures/Hashing/hashFunc.html |
| Last Crawled | 2025-07-23 17:08:39 (8 months ago) |
| First Indexed | not set |
| HTTP Status Code | 200 |
| Meta Title | Hashing Functions |
| Meta Description | null |
| Meta Canonical | null |
| Boilerpipe Text | h ( k ) = |_ M * ( k * A - |_ k * A _| ) _| where A is some real positive constant.
note that ( k * A - |_ k * A _| ) is between 0.0 and
1.0 Good choice for A -- the inverse of the golden ratio golden ratio Ø =
( 1 + sqrt (5) ) / 2 = 1.618033989.... so Ø -1 = 1 / 1.618033989...
= 0.618033989 Because of the relationship between the golden ratio and
Fibonacci numbers, this is also called "Fibonacci hashing" h ( k ) = |_ M * ( k * Ø -1
- |_ k * Ø -1 _| ) _| Some values for k and h ( k ) k h ( k ) 0 0 1 0.618 * M 2 0.236 * M 3 0.854 * M 4 0.472 * M 5 0.090 * M 6 0.708 * M 7 0.326 * M 8 0.562 * M 9 0.562 * M |
| Markdown | null |
| Readable Markdown | null |
| Shard | 92 (laksa) |
| Root Hash | 6541913094267234292 |
| Unparsed URL | edu,umbc!cs,courses,/341/fall99/frey/Lectures/Hashing/hashFunc.html s443 |