[B! hash] TAKESAKOã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

TAKESAKO id:TAKESAKO

hashã«é–¢ã™ã‚‹TAKESAKOã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (14)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

BLOG::broomie.net: gperfã¨Tokyo Cabinetã®ã‚¹ãƒ”ãƒ¼ãƒ‰ã‚’æ¯”è¼ƒã—ã¦ã¿ãŸ
ã“ã“ä½•å›žã‹gperfã®ãƒ¡ãƒ¢ã‚’å–ã£ã¦ãã¦ï¼Œã‹ã¤ã“ã“ã«ã¯æ›¸ã‹ãªã‹ã£ãŸã‘ã©å€‹äººçš„ã«ã‚µãƒ³ãƒ—ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ä½œã£ã¦æ”¹ã‚ã¦æ€ã£ãŸã‚“ã ã‘ã©ï¼Œgperfã£ã¦ãƒ«ãƒƒã‚¯ã‚¢ãƒƒãƒ—ãŒã‚ã¡ã‚ƒãã¡ã‚ƒé«˜é€Ÿãªã‚ã‘ã§ã™ãï¼Žå®Œå…¨ãƒãƒƒã‚·ãƒ¥ãªã®ã§å½“ç„¶ã£ã¡ã‚ƒãƒ¼å½“ç„¶ãªã®ã§ã™ãŒï¼Žæ—©ãã¦ãŠæ‰‹è»½ã£ã¦ã®ãŒgperfã®è‰¯ã„ã¨ã“ã‚ãªã‚ã‘ã§ã™ãŒï¼Žã•ã¦ã•ã¦ï¼Œæ—©ã„ã®ã‚ã‹ã£ãŸã‘ã©ï¼Œã©ã‚Œãã‚‰ã„æ—©ã„ã®ï¼Ÿã£ã¦ã®ã¯ä½•ã‹ã®æŒ‡æ¨™ãŒãªã‘ã‚Œã°ã‚ã‹ã‚Šã¾ã›ã‚“ãï¼Žãã“ã§ï¼Œä»Šã®ã¨ã“ã‚æœ€å¼·ã«æ—©ã„ã¨ã„ã‚ã‚Œã¦ã„ã‚‹Tokyo Cabinetã®hash DBMã¨ã®ã‚¹ãƒ”ãƒ¼ãƒ‰ã®æ¯”è¼ƒã‚’ã—ã¦ã¿ã‚ˆã†ã¨ã„ã†ï¼Œçµæ§‹ç„¡æ„å‘³ãªãƒ™ãƒ³ãƒãƒ†ã‚¹ãƒˆã‚’ã‚„ã£ã¦ã¿ãŸï¼Ž ãƒ‡ãƒ¼ã‚¿ã®æº–å‚™ ã‚„ã£ãŸã“ã¨ã¯å˜ç´”ã§ï¼Œãƒ©ãƒ³ãƒ€ãƒ ã«key, valueã®ã‚»ãƒƒãƒˆã‚’ä½œæˆã—ï¼Œãã‚Œãžã‚Œï¼‘ï¼ã‚»ãƒƒãƒˆï¼Œ100ã‚»ãƒƒãƒˆï¼Œ1000ã‚»ãƒƒãƒˆï¼Œ10000ã‚»ãƒƒãƒˆï¼Œ100000ã‚»ãƒƒãƒˆï¼Œã®DBã®ä½œæˆæ™‚é–“ã¨ï¼Œãƒ«ãƒƒã‚¯ã‚¢ãƒƒãƒ—ã®æ™‚é–“ã‚’æ¯”è¼ƒã—ã¦ã¿ãŸï¼Žã¡ãªã¿ã«keyã¯[A-Za-z1-9
TAKESAKO 2009/12/28
gperfã¨Tokyo Cabinetã®ã‚¹ãƒ”ãƒ¼ãƒ‰ã‚’æ¯”è¼ƒã—ã¦ã¿ãŸ

hash
ãƒªãƒ³ã‚¯
Rui:ThreadLibrary:NonBlockingHashTable
TAKESAKO 2009/10/13
http://akihironotes.blogspot.com/2007/07/lock-free-hash-table.html

hash

lockfree

hashtable
ãƒªãƒ³ã‚¯
Perlã¨Rubyã§çœãƒ¡ãƒ¢ãƒªãªãƒãƒƒã‚·ãƒ¥ã‚’ä½¿ãŠã† - mixi engineer blog
ã‚µãƒœã£ã¦ã„ãŸæ—©æœã‚¸ãƒ§ã‚®ãƒ³ã‚°ï¼ é§’æ²¢å…¬åœ’ã‚’å†é–‹ã—ã¦2é€±é–“ãŸã¡ã€ã‚„ã£ã¨æŠœã‹ã‚Œã‚‹æ•°ã‚ˆã‚ŠæŠœãæ•°ã®æ–¹ãŒå¢—ãˆã¦ããŸmikioã§ã™ã€‚ä»Šå›žã¯ã€Perlã‚„Rubyã®ãƒãƒƒã‚·ãƒ¥ã®ä»£ç”¨ã¨ã—ã¦Tokyo Cabinetã‚’ä½¿ã†ã“ã¨ã§ãƒ¡ãƒ¢ãƒªä½¿ç”¨é‡ã‚’æ¿€æ¸›ã•ã›ã‚‰ã‚Œã‚‹ã“ã¨ã‚’èª¬æ˜Žã—ã¾ã™ã€‚ æŠ½è±¡ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹API Tokyo Cabinetã«ã¯æŠ½è±¡ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã¨ã„ã†æ©Ÿæ§‹ãŒã‚ã‚Šã€å…ˆæ—¥ã€ãã®Perlã¨Rubyã®ãƒã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ãã‚Œã‚’ä½¿ã†ã¨ã€å„ç¨®è¨€èªžã®ãƒãƒƒã‚·ãƒ¥ã¨ã»ã¼åŒã˜ã‚ˆã†ãªå…±é€šã—ãŸã‚¤ãƒ³ã‚¿ãƒ¼ãƒ•ã‚§ã‚¤ã‚¹ã§ã€ä»¥ä¸‹ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’åˆ©ç”¨ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ ã‚ªãƒ³ãƒ¡ãƒ¢ãƒªãƒãƒƒã‚·ãƒ¥ï¼šå„ç¨®è¨€èªžã«æ¨™æº–ã®ãƒãƒƒã‚·ãƒ¥ã¨åŒã˜ãã€ãƒ¡ãƒ¢ãƒªä¸Šã§key/valueã®é–¢ä¿‚ã‚’è¡¨ç¾ã™ã‚‹ã€‚ ã‚ªãƒ³ãƒ¡ãƒ¢ãƒªãƒ„ãƒªãƒ¼ï¼šãƒ¡ãƒ¢ãƒªä¸Šã®äºŒåˆ†æŽ¢ç´¢æœ¨ã¨ã—ã¦key/valueã®é–¢ä¿‚ã‚’è¡¨ç¾ã™ã‚‹ã€‚ ãƒ•ã‚¡ã‚¤ãƒ«ãƒãƒƒã‚·ãƒ¥ï¼šã„ã‚ã‚†ã‚‹DBMã¨ã—ã¦ã€ãƒ•ã‚¡ã‚¤ãƒ«ä¸Šã§key/valueã®é–¢ä¿‚ã‚’è¡¨ç¾ã™ã‚‹ã€‚ ãƒ•ã‚¡
TAKESAKO 2009/04/23
ï¼žã€Œä»Šå›žã¯ã€Perlã‚„Rubyã®ãƒãƒƒã‚·ãƒ¥ã®ä»£ç”¨ã¨ã—ã¦Tokyo Cabinetã‚’ä½¿ã†ã“ã¨ã§ãƒ¡ãƒ¢ãƒªä½¿ç”¨é‡ã‚’æ¿€æ¸›ã•ã›ã‚‰ã‚Œã‚‹ã“ã¨ã‚’èª¬æ˜Žã—ã¾ã™ã€‚ã€

mixi

perl

ruby

hash

tokyocabinet

db
ãƒªãƒ³ã‚¯
Lux IOã®Perlãƒã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ã‚’ä½œæˆã—ãŸ - Kentaro Kuribayashi's blog
id:mogwaingã•ã‚“ãŒé–‹ç™ºã•ã‚Œã¦ã„ã‚‹Yet AnotherãªDBMã§ã‚ã‚‹ã¨ã“ã‚ã®Lux IOã‚’ä½¿ã£ã¦ã¿ãŸããªã£ãŸã®ã§ã€Perlã‹ã‚‰ä½¿ãˆã‚‹ã‚ˆã†ãƒã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ã‚’æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚åˆXSãªä¸Šã«C/C++ã‚‚ã‚ãã«æ›¸ã„ãŸã“ã¨ãŒãªã„ã®ã§ã‚ã‹ã‚“ãªã„ã¨ã“ã‚ã ã‚‰ã‘ã§ã™ãŒã€ãªã‚“ã‹ä¸€å¿œå‹•ãã‚ˆã†ã«ãªã£ãŸã£ã½ã„ã®ã§ã€GitHubã«ä¸Šã’ã¦ãŠãã¾ã—ãŸã€‚ kentaro's perl-lux-io at master â€” GitHub ã”è¦§ã«ãªã‚Œã°ã‚ã‹ã‚‹é€šã‚Šã€ãªã‚“ã‹ã›ã£ã‹ãC++ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’è§¦ã‚‹ã®ã«ã€é–¢æ•°ã‚’ãƒ™ã‚¿ãƒ™ã‚¿æ›¸ã„ã¦ãƒ©ãƒƒãƒ—ã—ã¦ã‚‹ã ã‘ã§ã€ãªã‚“ã¨ã‚‚ãƒ€ã‚µã„æ„Ÿã˜ã€‚typemapã‚’ã†ã¾ãä½¿ãˆã°ã„ã„æ„Ÿã˜ã«ãªã‚‹ã¨ã„ã†ã“ã¨ã ã£ãŸã®ã ã‘ã©ã€Lux::IO::Btreeã¿ãŸã„ãªã‚³ãƒãƒ³ã¤ãã®åž‹ã‚„ã€Lux::IO::*ä»¥ä¸‹ã«ã‚ã‚‹structã‚„enumã‚’ã©ã†typemapã™ã‚Œã°ã„ã„ã®ã‹ã‚ã‹ã‚‰ãªã‹ã£ãŸã®ã§ã€ã“ã‚“ãªæ„Ÿã˜ã«ã€‚ ä»¥ä¸‹ã€ã‚ã‚Œã“ã‚Œè©¦è¡Œ
TAKESAKO 2008/12/25
perl

luxio

hash
ãƒªãƒ³ã‚¯
Lux IO - Yet Another Fast Database Manager
Lux IO is a yet another fast database manager. It supports B+-tree and Array index in either cluster or non-cluster index. It's originally designed for storing large expanding data as a value in Lux Search Engine, but it's also pretty fast for small and a large number of data. Fast key lookup (B+-tree, Array) Support both clustered and non-clustered index mmap(2) the whole index structure in clust
TAKESAKO 2008/12/25
c++

dbm

hash
ãƒªãƒ³ã‚¯
Perlã®hash - mizuno_takaakiã®æ—¥è¨˜
Perlã®hashã£ã¦ç›¸å½“ä½¿ã£ã¦ã‚‹ã‘ã©ã€ä¸èº«çŸ¥ã‚‰ãªã„ãªãƒ¼ã€ã¨ãµã¨æ€ã„ã€èª¿ã¹ã¦ã¿ãŸã‚‰ã€ã“ã‚“ãªãƒšãƒ¼ã‚¸ãŒã‚ã£ãŸã€‚ http://www.perl.com/lpt/a/679 2002å¹´ã«æ›¸ã‹ã‚ŒãŸã‚‚ã®ã§ã€ã¡ã‚‡ã£ã¨å¤ã„ã‘ã‚Œã©ã€èªã‚“ã§ã„ã£ãŸã‚‰ã€è©³ã—ãçŸ¥ã‚ŠãŸã‹ã£ãŸã‚‰ã¨ã‚Šã‚ãˆãšPerl 1.0ã®hash.cã‹ã‚‰å§‹ã‚ãŸã‚‰ã„ã„ã‚“ã˜ã‚ƒãªã„ã‹ã¿ãŸã„ãªã“ã¨ã‹ã‚‰æ›¸ã„ã¦ã‚ã£ã¦ã€ãªã‚‹ã»ã©ã¨æ€ã£ã¦èªã‚“ã§ã¿ãŸã€‚çŸã„ã€‚ ä¸Žãˆã‚‰ã‚ŒãŸã‚ãƒ¼ã‹ã‚‰ãƒ‡ãƒ¼ã‚¿ã®å…¥ã£ã¦ã„ã‚‹å ´æ‰€ã‚’æŽ¢ã™ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã¨ã—ã¦ã¯ã€ä»¥ä¸‹ã¿ãŸã„ãªãƒ«ãƒ¼ãƒ—ã€‚ for (s=key,i=0,hash = 0; /* while */ *s; s++,i++,hash *= 5) { hash += *s * coeff[i]; } oentry = &(tb->tbl_array[hash & tb->tbl_max]); ã“ã‚“ãªæ„Ÿã˜ã§ã€ã‚ãƒ¼ã®æ–‡å—ï¼‘æ–‡å—ãšã¤ã‚’ä½¿ã£ã¦coeffã¨ã„
TAKESAKO 2008/06/29
perl

xs

hash
ãƒªãƒ³ã‚¯
ç¬¬3ç« åå‰ã¨åå‰è¡¨
st_table ãƒ¡ã‚½ãƒƒãƒ‰ãƒ†ãƒ¼ãƒ–ãƒ«ã‚„ã‚¤ãƒ³ã‚¹ã‚¿ãƒ³ã‚¹å¤‰æ•°ãƒ†ãƒ¼ãƒ–ãƒ«ã¨ã—ã¦st_tableã¯æ—¢ã«ä½•åº¦ã‹ç™» å ´ã—ã¦ããŸã€‚æœ¬ç« ã§ã¯ã¾ãšã“ã®st_tableã«ã¤ã„ã¦è©³ã—ã„ä½œã‚Šã‚’è¦‹ã¦ã„ãã“ã¨ã« ã—ã‚ˆã†ã€‚ æ¦‚è¦ st_tableã¯ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ã ã¨ã„ã†ã“ã¨ã¯ã‚‚ã†è¨€ã£ãŸã€‚ã§ã¯ãƒãƒƒã‚·ãƒ¥ ãƒ†ãƒ¼ãƒ–ãƒ«ã¯ä½•ã‹ã¨è¨€ã†ã¨ä¸€å¯¾ä¸€å¯¾å¿œã‚’è¨˜éŒ²ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚‹ã€‚ä¸€å¯¾ä¸€ã®å¯¾ å¿œã¨ã¯ä¾‹ãˆã°å¤‰æ•°åã¨ãã®å€¤ã€é–¢æ•°åã¨ãã®å®Ÿä½“ã€ãªã©ã ã€‚ ãŸã ã—ã‚‚ã¡ã‚ã‚“ãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ä»¥å¤–ã§ã‚‚ä¸€å¯¾ä¸€å¯¾å¿œã¯è¡¨ã›ã‚‹ã€‚ ä¾‹ãˆã°æ¬¡ã®ã‚ˆã†ãªæ§‹é€ ä½“ã®ãƒªã‚¹ãƒˆã‚’ä½¿ã£ã¦ã‚‚ã„ã„ã€‚ struct entry { ID key; VALUE val; struct entry *next; /* æ¬¡ã®ã‚¨ãƒ³ãƒˆãƒªã‚’æŒ‡ã™ */ }; ã—ã‹ã—ã“ã®æ–¹æ³•ã¯ã€Œé…ã„ã€ã€‚ã‚‚ã—ãƒªã‚¹ãƒˆãŒ1000å€‹ã‚ã£ãŸã‚‰æœ€æ‚ª1000å›žãƒªãƒ³ã‚¯ã‚’ ãŸãã£ã¦æŽ¢ã•ãªã‘ã‚Œã°ãªã‚‰ãªã„ã€‚ã¤ã¾ã‚Šè¦ç´ ã®å€‹æ•°ã«æ¯”ä¾‹ã—ã¦æ¤œç´¢æ™‚é–“ãŒé•·ã
TAKESAKO 2008/06/22
ã€ã¡ãªã¿ã«Googleã§è¦‹ä»˜ã‘ãŸä»–ã®ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã®ã‚³ãƒ¡ãƒ³ãƒˆã‹ã‚‰ã™ã‚‹ã¨ st_tableã¯STring TABLEã®ç•¥ã‚‰ã—ã„ã€‚ã—ã‹ã—general purposeã¨ã„ã†æ–‡é¢ã¨ stringã§ã¯ã¾ã‚‹ãã‚ŠçŸ›ç›¾ã—ã¦ã„ã‚‹ã¨æ€ã†ã®ã ãŒâ€¦â€¦ã€‚ ã€‘

ruby

hash
ãƒªãƒ³ã‚¯
Consistent Hashingãªæ‹¡å¼µãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ« - Do You PHP ã¯ã¦ãƒ–ãƒ
Consistent Hashingã«ã¤ã„ã¦ã¯ä»¥ä¸‹ã‚’å‚ç…§ã€‚è¦ã¯ã€Œã‚ãƒ£ãƒƒã‚·ãƒ¥ã‚’åˆ†æ•£ã•ã›ãŸå ´åˆã§åˆ†æ•£ã•ã›ã‚‹æ•°ãŒå¤‰ã‚ã£ãŸã¨ãã«ã€ã€Œorzã€ã¨ãªã‚‰ãªã„ã‚ˆã†ã«ã™ã‚‹ãŸã‚ã®ä»•çµ„ã¿ã®1ã¤ã€ãªæ„Ÿã˜ã§ã™ï¼ˆå¤šåˆ†ï¼‰ã€‚ http://www.hyuki.com/yukiwiki/wiki.cgi?ConsistentHashing mixi engineer blog ã§ã€ãã‚Œã‚’å®Ÿç¾ã™ã‚‹ãŸã‚ã®Cãƒ©ã‚¤ãƒ–ãƒ©ãƒªã¨ã—ã¦libketamaãŒã‚ã‚Šã¾ã™ã€‚ API â€“ Last.fm ã“ã®libketamaã®ã‚½ãƒ¼ã‚¹ã«ã¯Pythonã€Javaã€PHPã®å„ãƒã‚¤ãƒ³ãƒ‡ã‚£ãƒ³ã‚°ãŒå«ã¾ã‚Œã¦ã„ã‚‹ã‚ˆã†ãªã®ã§ã€ã¡ã‚‡ã£ã¨ä½¿ã£ã¦ã¿ã¾ã—ãŸã€‚ ã¾ãšã¯ã€ã‚½ãƒ¼ã‚¹ã‚’checkoutã€‚ä½¿ç”¨ãƒªãƒ“ã‚¸ãƒ§ãƒ³ã¯398ã§ã™ã€‚ $ svn co svn://svn.audioscrobbler.net/misc/ketama $ buildæ‰‹é †ã¯ä»¥ä¸‹ã®é€šã‚Šã€‚Makefileã‚’ç½®æ›
TAKESAKO 2008/03/26
hash
ãƒªãƒ³ã‚¯
Web Services - Audioscrobbler Las.fm API
Last.fm APIGetting startedAPI Guides IntroductionAuthentication Web How-ToMobile How-ToDesktop How-ToAuth SpecScrobbling 2.0 DocumentationRadio APIPlaylists API API ToolsREST RequestsXML-RPCTerms of ServiceAPI Methods album album.addTagsalbum.getInfoalbum.getTagsalbum.getTopTagsalbum.removeTagalbum.searchartist artist.addTagsartist.getCorrectionartist.getInfoartist.getSimilarartist.getTagsartist.ge
TAKESAKO 2007/12/03
hash

algorithm
ãƒªãƒ³ã‚¯
ConsistentHashing - ã‚³ãƒ³ã‚·ã‚¹ãƒ†ãƒ³ãƒˆãƒ»ãƒãƒƒã‚·ãƒ¥æ³•
ConsistentHashing - ã‚³ãƒ³ã‚·ã‚¹ãƒ†ãƒ³ãƒˆãƒ»ãƒãƒƒã‚·ãƒ¥æ³• ç›®æ¬¡ ã“ã®æ–‡æ›¸ã«ã¤ã„ã¦ ã‚³ãƒ³ã‚·ã‚¹ãƒ†ãƒ³ãƒˆãƒ»ãƒãƒƒã‚·ãƒ¥æ³• å®Ÿä¾‹ å®Ÿè£… ç”¨é€” ã‚³ãƒ³ã‚·ã‚¹ãƒ†ãƒ³ãƒˆãƒ»ãƒãƒƒã‚·ãƒ¥æ³• ã“ã®æ–‡æ›¸ã«ã¤ã„ã¦ "Tom White's Blog: Consistent Hashing" ã®æ—¥æœ¬èªžè¨³ã§ã™. http://weblogs.java.net/blog/tomwhite/archive/2007/11/consistent_hash.html æŽ¨æ•²æ“è¿Ž: èª¤è¨³, ã‚¿ã‚¤ãƒ, è¨³èªžã®ä¸çµ±ä¸€, ãã®ã»ã‹... åŽŸæ–‡ã®ãƒ©ã‚¤ã‚»ãƒ³ã‚¹: http://creativecommons.org/licenses/by-nc-sa/2.0/ ç§ã¯ä»Šã¾ã§ã«ä½•åº¦ã‹ã‚³ãƒ³ã‚·ã‚¹ãƒ†ãƒ³ãƒˆãƒ»ãƒãƒƒã‚·ãƒ¥æ³•ã«ã¨ã‚Šãã‚“ã ã“ã¨ãŒã‚ã‚‹ã€‚ ã“ã®ã‚¢ã‚¤ãƒ‡ã‚¢ã‚’ã‚ã‚‰ã‚ã—ãŸè«–æ–‡ ( David Karger ã‚‰ã«ã‚ˆã‚‹ Consistent Hashing and R
TAKESAKO 2007/12/03
algorithm

hash

c

memcached

java

md5
ãƒªãƒ³ã‚¯
http://homepage1.nifty.com/herumi/diary/0711.html
TAKESAKO 2007/11/21
ç´ æ™´ã‚‰ã—ã„

hash
ãƒªãƒ³ã‚¯
Hash functions.
Â© Copyright 2004-2008 by Paul Hsieh Why look at hash functions? In a previous job, I was asked to look at hashing functions and got into a dispute with my boss about how such functions should be designed. I had advocated the used of LFSRs or CRCs that would be customized to the size of the table, as discussed in "Numerical Recipes". My boss advocated simply performing a modulo by prime operation a
TAKESAKO 2007/08/26
SuperFastHash x86 asm ã®ã‚³ãƒ¼ãƒ‰ã‚‚

algorithm

hash
ãƒªãƒ³ã‚¯
Inside Tokyo Cabinet ãã®å£± - mixi engineer blog
ç´„åŠå¹´é–“ã®æ²ˆé»™ã‚’ç ´ã£ã¦OSSã®ä¸–ç•Œã«æˆ»ã£ã¦ãã¤ã¤ã‚ã‚‹mikioã§ã™ã€‚å…ˆæ—¥ã€Tokyo Cabinetï¼ˆä»¥ä¸‹ã€ŒTCã€ã¨å‘¼ã³ã¾ã™ï¼‰ã¨ã„ã†ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ä»Šå›žã‹ã‚‰æ•°å›žã«åˆ†ã‘ã¦ã€TCã®è¨è¨ˆã¨è‹¦åŠ´è©±ã«ã¤ã„ã¦é€£è¼‰ã—ã¦ã¿ã¾ã™ã€‚ DBMã¨ã¯ TCã¯ã€ã„ã‚ã‚†ã‚‹DBMã®ç³»èœã®ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã€å˜ç´”ãªãƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ãƒ«ã‚’ãƒ•ã‚¡ã‚¤ãƒ«ä¸Šã§æ°¸ç¶šåŒ–ã™ã‚‹ã ã‘ã®æ©Ÿèƒ½ã‚’æä¾›ã—ã¾ã™ã€‚DBMã¯AT&Tã®å¤ä»£UNIXã®æ™‚ä»£ã‹ã‚‰å—ã‘ç¶™ãŒã‚Œã‚‹ä¼çµ±èŠ¸èƒ½ãªã®ã§ã™ãŒã€ç§ã¯ãã†ã„ã†æž¯ã‚ŒãŸæŠ€è¡“ãŒå¤§å¥½ããªã®ã§ã™ã€‚ ãƒ—ãƒã‚°ãƒ©ãƒžã®çš†ã•ã‚“ã¯ã€Perlã‚„Rubyã§ã¯ãƒãƒƒã‚·ãƒ¥ï¼ˆé€£æƒ³é…åˆ—ï¼‰ã¨å‘¼ã°ã‚Œã€Javaã‚„C++ã§ã¯mapã¨å‘¼ã°ã‚Œã‚‹ã‚ˆã†ãªã€ä½•ã‚‰ã‹ã®ã‚ãƒ¼ã«é–¢é€£ã¥ã‘ã¦ãªã‚“ã‚‰ã‹ã®å€¤ã‚’è¨˜éŒ²ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã£ã¦å®Ÿã«ã‚ˆãä½¿ã„ã¾ã™ã‚ˆãã€‚ä¾‹ãˆã°mixiã§ã¯ã€ãƒ¦ãƒ¼ã‚¶ã‚¢ã‚«ã‚¦ãƒ³ãƒˆã«é–¢é€£ã™ã‚‹æƒ…å ±ï¼ˆåå‰ã¨ã‹ãƒ‹ãƒƒã‚¯ãƒãƒ¼ãƒ ã¨ã‹ï¼‰ã¯ã€ãƒ¦ãƒ¼ã‚¶IDã‚’ã‚ãƒ¼ã«ã—ãŸãƒãƒƒ
TAKESAKO 2007/08/24
mixi

hash

database

algorithm

dbm
ãƒªãƒ³ã‚¯
Azul Systems - Cliff Click Jr.â€™s Blog: A Non-Blocking HashTable
A Non-Blocking HashTable March 27, 2007 I've been wrestling with concurrent algorithms again.Â This time, it's a Non-Blocking (concurrent, lock-free) HashTable.Â I've had it basically figured out for a few months now and I'm slowing widening the circle of people I expose it too.Â This HashTable seems too good to be true, which is why I'm trying hard to vet it's correctness before claiming victory
TAKESAKO 2007/05/31
concurrency

algorithm

hash

hashtable

lockfree
ãƒªãƒ³ã‚¯
1