see also google talks bloom filter. may replace perfect hashing if the requirement of load factor is low.

fcicq のブックマーク 2011/01/03 11:31

<blockquote class="hatena-bookmark-comment"><a class="comment-info" href="https://b.hatena.ne.jp/entry/4241765/comment/fcicq" data-user-id="fcicq" data-entry-url="https://b.hatena.ne.jp/entry/s/en.wikipedia.org/wiki/Cuckoo_hashing" data-original-href="https://en.wikipedia.org/wiki/Cuckoo_hashing" data-entry-favicon="https://cdn-ak2.favicon.st-hatena.com/64?url=https%3A%2F%2Fen.wikipedia.org%2Fwiki%2FCuckoo_hashing" data-user-icon="/users/fcicq/profile.png">Cuckoo hashing - Wikipedia</a><ul class="comment-tag" style="list-style: none; margin: 0px;"><li style="float: left">[<a href="https://b.hatena.ne.jp/q/hash">hash</a>]</li><li style="float: left">[<a href="https://b.hatena.ne.jp/q/algorithms">algorithms</a>]</li></ul><br><p style="clear: left">see also google talks bloom filter. may replace perfect hashing if the requirement of load factor is low.</p><a class="datetime" href="https://b.hatena.ne.jp/fcicq/20110103#bookmark-4241765"><span class="datetime-body">2011/01/03 11:31</span></a></blockquote><script src="https://b.st-hatena.com/js/comment-widget.js" charset="utf-8" async></script>

このブックマークにはスターがありません。
最初のスターをつけてみよう！

Cuckoo hashing - Wikipedia

en.wikipedia.org2007/03/18

Cuckoo hashing example. The arrows show the alternative location of each key. A new it em would be inserted in the location of A by moving A to its alternative location, currently occupied by B, and...

10 人がブックマーク・3 件のコメント

他のコメントを読む

＼コメントがサクサク読めるアプリです／

はてなブックマーク

Cuckoo hashing - Wikipedia

はてなブックマーク

公式Twitter

はてなのサービス