[B! dbm] mogwaingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

mogwaing id:mogwaing

dbmã«é–¢ã™ã‚‹mogwaingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (21)

${{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}}

ã€Œã‚ãƒ¼ãƒ»ãƒãƒªãƒ¥ãƒ¼åž‹ãƒ‡ãƒ¼ã‚¿ã‚¹ãƒˆã‚¢ã€é–‹ç™ºè€…ãŒå¤§é›†åˆã—ãŸå¤œ
ã€Œç™ºè¡¨è€…ãŒè‡ªåˆ†ã‚ˆã‚Šã‚‚è‹¥ã„äººã°ã‹ã‚Šã ã€ã€‚å¤–è¦‹ãŒ20ä»£ã«ã—ã‹è¦‹ãˆãªã„æ±äº¬å·¥æ¥å¤§å¦ã®é¦–è—¤ä¸€å¹¸å‡†æ•™æŽˆï¼ˆ1973å¹´ç”Ÿï¼‰ã®é©šãã•ã¾ãŒã€å°‘ã—é¢ç™½ã‹ã£ãŸã€‚2009å¹´2æœˆ20æ—¥ã®å¤œã€å¤šãã®Webä¼æ¥ãŒæ³¨ç›®ã™ã‚‹ã€Œã‚ãƒ¼ãƒ»ãƒãƒªãƒ¥ãƒ¼åž‹ãƒ‡ãƒ¼ã‚¿ã‚¹ãƒˆã‚¢ã€ã‚’é–‹ç™ºã™ã‚‹è‹¥æ‰‹æŠ€è¡“è€…ãŒã€æ±äº¬ãƒ»å…æœ¬æœ¨ã®ã‚°ãƒªãƒ¼æœ¬ç¤¾ã«ä¸€å ‚ã«ä¼šã—ãŸã€‚ ã‚ãƒ¼ãƒ»ãƒãƒªãƒ¥ãƒ¼åž‹ãƒ‡ãƒ¼ã‚¿ã‚¹ãƒˆã‚¢ï¼ˆã¾ãŸã¯ã‚ãƒ¼ãƒ»ãƒãƒªãƒ¥ãƒ¼åž‹ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ï¼‰ã¯ã€å¤§é‡ã®ãƒ¦ãƒ¼ã‚¶ãƒ¼ã¨ãƒ‡ãƒ¼ã‚¿ã‚’æŠ±ãˆã€ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã®ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹å•é¡Œã¨ã‚³ã‚¹ãƒˆé«˜ã«é ã‚’æ‚©ã¾ã›ã‚‹Webä¼æ¥ãŒæ³¨ç›®ã™ã‚‹æŠ€è¡“ã§ã‚ã‚‹ã€‚è¨˜è€…ã¯åŒæ—¥ã«é–‹å‚¬ã•ã‚ŒãŸã€ŒKey-Value Store å‹‰å¼·ä¼šã€ã«å‚åŠ ã•ã›ã¦ã‚‚ã‚‰ã£ãŸã€‚åˆå¾Œ7æ™‚ã‹ã‚‰11æ™‚ã¾ã§ã€ã‚ãƒ¼ãƒ»ãƒãƒªãƒ¥ãƒ¼åž‹ãƒ‡ãƒ¼ã‚¿ã‚¹ãƒˆã‚¢ã‚’é–‹ç™ºãƒ»ç ”ç©¶ã™ã‚‹è‹¥æ‰‹æŠ€è¡“è€…ãŒç«‹ã¦ç¶šã‘ã«ç™»å ´ã—ã€1äºº15åˆ†ã®æŒã¡æ™‚é–“ã§æˆæžœã‚’ç™ºè¡¨ã—ã€è°è«–ã‚’é‡ãã‚‹ã¨ã„ã†é›†ã¾ã‚Šã ã€‚ å‘¼ã³ã‹ã‘äººã§ã‚ã‚‹ãƒ—ãƒªãƒ•ã‚¡ãƒ¼ãƒ‰ã‚¤ãƒ³ãƒ•ãƒ©ã‚¹ãƒˆãƒ©ã‚¯ãƒãƒ£ãƒ¼ï¼ˆPFIï¼‰æœ€é«˜æŠ€è¡“è²¬ä»»è€…
mogwaing 2009/02/27
kvs

key-value

database

dbm

consistent hash
ãƒªãƒ³ã‚¯
Google Code Archive - Long-term storage for Google Code Project Hosting.
Code Archive Skip to content Google About Google Privacy Terms
mogwaing 2009/02/27
redis

key-value

database

dbm
ãƒªãƒ³ã‚¯
Introduction to Tokyo Products
mogwaing 2008/11/16
dbm

tokyocabinet
ãƒªãƒ³ã‚¯
Hamster DB â€“ A Data Science Blog
Online data science provides the students with a flexible and affordable path towards a very lucrative data science job. According to the bureau of Labor Statistics the projected employment growth for database administrators is 11% with the current average salary for database administrators standing at $87,020. The increasing popularity of data analytics and data base administrators adds to the ev
mogwaing 2008/11/08
dbm

b+tree

database

must
ãƒªãƒ³ã‚¯
Rubyã‹ã‚‰ã‚‚LuxIOã‚’ä½¿ã£ã¦ã¿ã‚‹ - ãƒ¦ãƒ¼ã‚¦ãƒ„ãªé›¨ãŒãµã‚Šã¤ã¥ã„ã¦ã‚‚é›ªãŒãƒãƒ¼ãƒˆã‚’æ›‡ã‚‰ã›ã¦ã‚‚ãƒ‰ã‚¢ã®ä¸ã§å¾…ã£ã¦ã„ãŸå›ã«é”æ³•ã‚’ã‹ã‘ãŸã„ã®ã•
å‰å›ž( Lux IO(ãƒ©ãƒƒã‚¯ã‚¹ ã‚¢ã‚¤ã‚ªãƒ¼)ã‚’PHPã‹ã‚‰ä½¿ã£ã¦ã¿ã‚‹ - ãƒ¦ãƒ¼ã‚¦ãƒ„ãªé›¨ãŒãµã‚Šã¤ã¥ã„ã¦ã‚‚é›ªãŒãƒãƒ¼ãƒˆã‚’æ›‡ã‚‰ã›ã¦ã‚‚ãƒ‰ã‚¢ã®ä¸ã§å¾…ã£ã¦ã„ãŸå›ã«é”æ³•ã‚’ã‹ã‘ãŸã„ã®ã•)ã«å¼•ãç¶šãRubyã§ã‚‚LuxIOã‚’ä½¿ã£ã¦ã¿ã¾ã—ãŸã€‚ã‚½ãƒ¼ã‚¹ã¯ä¸‹è¨˜ã«ãŠã„ã¦ã¾ã™ã€‚kajidaiâ€™s rluxio at master â€” GitHubã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ« $ git clone git://github.com/kajidai/rluxio.git $ cd rluxio $ ruby extconf.rb $ make ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ require 'luxio' luxio = LuxIOBtree.new luxio.open '/var/tmp/test', LuxIOBtree::LUX_DB_CREAT luxio.put 'key', 'value' luxio.get 'value'
mogwaing 2008/11/08
lux

database

dbm

ruby
ãƒªãƒ³ã‚¯
Lux IO(ãƒ©ãƒƒã‚¯ã‚¹ ã‚¢ã‚¤ã‚ªãƒ¼)ã‚’PHPã‹ã‚‰ä½¿ã£ã¦ã¿ã‚‹ - ãƒ¦ãƒ¼ã‚¦ãƒ„ãªé›¨ãŒãµã‚Šã¤ã¥ã„ã¦ã‚‚é›ªãŒãƒãƒ¼ãƒˆã‚’æ›‡ã‚‰ã›ã¦ã‚‚ãƒ‰ã‚¢ã®ä¸ã§å¾…ã£ã¦ã„ãŸå›ã«é”æ³•ã‚’ã‹ã‘ãŸã„ã®ã•
Lux IOã¨ã„ã†é«˜é€Ÿãªãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ãƒžãƒãƒ¼ã‚¸ãƒ£(DBM)ã‚’å…¬é–‹ã—ã¾ã—ãŸã€‚å…ƒã€…ã¯ã€keyã«å¯¾ã—ã¦é•·ãæ‹¡å¼µã—ã¦ã„ãvalueã‚’ä¿æŒã§ãã‚‹ã‚ˆã†ã«ã€Luxã®å†…éƒ¨ã‚¹ãƒˆãƒ¬ãƒ¼ã‚¸ã‚¨ãƒ³ã‚¸ãƒ³ã¨ã—ã¦é–‹ç™ºã‚’å§‹ã‚ã¾ã—ãŸãŒã€ä¸€èˆ¬çš„ãªDBMã®ã‚ˆã†ãªä½¿ã„æ–¹ã«ãŠã„ã¦ã‚‚ã€éžå¸¸ã«é«˜é€Ÿã«å‹•ä½œã—ã¾ã™ã€‚ï¼ˆè©³ã—ãã¯ã€sourceforgeã®ãƒšãƒ¼ã‚¸ã®ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã‚’å‚ç…§ãã ã•ã„ã€‚ï¼‰ Lux IO - Yet Another Fast Database Manager : no hacking, no lifeLux IOã¨ã„ã†éžå¸¸ã«é«˜é€ŸãªdbmãŒå…¬é–‹ã•ã‚Œã¾ã—ãŸã€‚Lux IOç”¨ã®php bindingã‚’ä½œã£ã¦GitHub â€” Server Errorä½¿ã£ã¦ã¿ã¾ã—ãŸã€‚ ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ãŒä¸‹è¨˜ã§ $luxiobtree = new LuxIOBtree(); $luxiobtree->open('test', LUX_DB_CREAT); $re
mogwaing 2008/11/04
ä»•äº‹ã¯ã‚„ã™ãŽ

lux

dbm

php

kajidai
ãƒªãƒ³ã‚¯
Lux IO - Yet Another Fast Database Manager : no hacking, no life
Lux IOã¨ã„ã†é«˜é€Ÿãªãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ãƒžãƒãƒ¼ã‚¸ãƒ£(DBM)ã‚’å…¬é–‹ã—ã¾ã—ãŸã€‚ å…ƒã€…ã¯ã€keyã«å¯¾ã—ã¦é•·ãæ‹¡å¼µã—ã¦ã„ãvalueã‚’ä¿æŒã§ãã‚‹ã‚ˆã†ã«ã€Luxã®å†…éƒ¨ã‚¹ãƒˆãƒ¬ãƒ¼ã‚¸ã‚¨ãƒ³ã‚¸ãƒ³ã¨ã—ã¦é–‹ç™ºã‚’å§‹ã‚ã¾ã—ãŸãŒã€ä¸€èˆ¬çš„ãªDBMã®ã‚ˆã†ãªä½¿ã„æ–¹ã«ãŠã„ã¦ã‚‚ã€éžå¸¸ã«é«˜é€Ÿã«å‹•ä½œã—ã¾ã™ã€‚ï¼ˆè©³ã—ãã¯ã€sourceforgeã®ãƒšãƒ¼ã‚¸ã®ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã‚’å‚ç…§ãã ã•ã„ã€‚ï¼‰ ä¸€èˆ¬çš„ãªDBMã§ã¯ã€ãƒãƒƒã‚·ãƒ¥ã‚’ã‚µãƒãƒ¼ãƒˆã—ã¦ã„ã¾ã™ãŒã€Lux IOã§ã¯B+-treeã‚’é…åˆ—ã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã®ã¿ã‚’ã‚µãƒãƒ¼ãƒˆã—ã¦ã„ã¾ã™ã€‚ ãƒ‰ã‚ãƒ¥ãƒ¡ãƒ³ãƒˆã¯å…¨ãæ›¸ã‘ã¦ã„ãªãæç¸®ã§ã™ãŒã€ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã®testãƒ‡ã‚£ãƒ¬ã‚¯ãƒˆãƒªã«ãŸãã•ã‚“ã®ãƒ†ã‚¹ãƒˆãƒ—ãƒã‚°ãƒ©ãƒ ãŒã‚ã‚‹ã®ã§ã€ãã‚Œã‚’å‚è€ƒã«ã—ã¦ã¿ã¦ãã ã•ã„ã€‚ ãœã²ã€ä½¿ã£ã¦ã¿ã¦ã€æ„Ÿæƒ³ã€ãƒã‚°å ±å‘Šã‚’é ‚ã‘ã‚Œã°ã¨æ€ã„ã¾ã™ã€‚ Youâ€™re currently reading â€œ Lux IO - Yet Another Fast Databas
mogwaing 2008/11/02
lux

dbm

search

database
ãƒªãƒ³ã‚¯
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
mogwaing 2008/11/01
dbm

lux

database

search
ãƒªãƒ³ã‚¯
https://memcachedb.org/
mogwaing 2008/07/18
dbm

memcached

berkeleydb
ãƒªãƒ³ã‚¯
DBM - Wikipedia
dBm, a unit for power measurement DBM (computing), family of key-value database engines including dbm, ndbm, gdbm, and Berkeley DB Database Manager (DBM), a component of 1987's Extended Edition v1.0 release of IBM's OS/2 operating system Dibenzoylmethane, an aromatic diketone: 1,3-diphenylpropane-1,3-dione Dibromomethane, a halomethane Difference bound matrix, a data structure used in a field of c
mogwaing 2008/06/14
dbm

database

wikipedia
ãƒªãƒ³ã‚¯
tx bepã®å†…éƒ¨æŠ€è¡“ã®ç™ºè¡¨ - DO++
txã¨bepã®å†…éƒ¨ã§ä½¿ã‚ã‚Œã¦ã„ã‚‹æŠ€è¡“ã«ã¤ã„ã¦ã‚°ãƒ¼ã‚°ãƒ«æ±äº¬ã§è©±ã—ã¦ãã¾ã—ãŸã€‚ ç™ºè¡¨è³‡æ–™ [ppt/pdf] txã¯loudsã¨å‘¼ã°ã‚Œã‚‹æœ¨æ§‹é€ ã®ç°¡æ½”è¡¨ç¾ã‚’åˆ©ç”¨ã—ã¦ã„ã¦ã€bepã¯æœ€å°å®Œå…¨ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã‚’åˆ©ç”¨ã—ã¦ã„ã¾ã™ã€‚ ãã®ä»–ã“ã¾ã”ã¾ã¨ã—ãŸå®Ÿè£…ã‚‚æ›¸ã„ã¦ã‚ã‚Šã¾ã™ï¼ˆä¾‹ãˆã°ã€trieã®æžã«ã¤ã„ã¦ã„ã‚‹æ–‡å—æƒ…å ±ã¯ã©ã†ä¿å˜ã•ã‚Œã¦ã„ã‚‹ã‹ã¨ã‹ï¼‰ ã„ã‚ã„ã‚è²´é‡ãªæ„è¦‹ã‚‚ã„ãŸã ã„ãŸã®ã§ãã‚Œã‚’åæ˜ ã•ã›ã¦ã„ã“ã†ã¨ãŠã‚‚ã„ã¾ã™ã€‚ hey there and thank you for your info - I've certainly picked up anything new from right here. I did however expertise a few technical issues using this web site, as I experienced to reload the site man
mogwaing 2008/06/10
tx

bep

dbm

algorithm

must
ãƒªãƒ³ã‚¯
LibMap::Array - å…±æœ‰ãƒ¡ãƒ¢ãƒªä¸Šã«é…åˆ—ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚’æ§‹ç¯‰ã™ã‚‹ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆãƒ©ã‚¤ãƒ–ãƒ©ãƒª : no hacking, no life
ã‚´ãƒ¼ãƒ«ãƒ‡ãƒ³ã‚¦ã‚£ãƒ¼ã‚¯ã«å°‘ã—æ™‚é–“ãŒã‚ã£ãŸã®ã§ã€å…±æœ‰ãƒ¡ãƒ¢ãƒªã‚’æ‰±ã†libmapã¨ã„ã†C++ã®ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’ä½œã‚Šã¾ã—ãŸã€‚ ä»Šã®ã¨ã“ã‚ã€å€¤ãŒå›ºå®šé•·ã®æ°¸ç¶šçš„ãªé…åˆ—ã‚’æ§‹ç¯‰ã™ã‚‹éƒ¨åˆ†(LibMap::Array - é…åˆ—ã‚’æ‰±ã†DBMã¿ãŸã„ãªã‚‚ã®)ã—ã‹ã§ãã¦ã„ã¾ã›ã‚“ã€‚LibMap::Arrayã¯æ›¸ãè¾¼ã‚€indexã«å¿œã˜ã¦é ˜åŸŸãŒè‡ªå‹•çš„ã«æ‹¡å¼µã•ã‚Œã‚‹ã®ã§ã€å‰ã‚‚ã£ã¦ã‚µã‚¤ã‚ºã‚’æŒ‡å®šã™ã‚‹å¿…è¦ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ ä½¿ã„æ–¹ã¯ã‚½ãƒ¼ã‚¹ã¨ä¸‹ã®ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ã‚’è¦‹ã¦ãã ã•ã„ã€‚çµæ§‹é©å½“ã«ä½œã£ã¦ã‚ã¾ã‚Šãƒ†ã‚¹ãƒˆã—ã¦ãªã„ã®ã§ãƒã‚°ãŒã‚ã‚‹ã¨æ€ã‚ã‚Œã¾ã™ã€‚ libmap.h (ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã¯LGPL) ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ ä»¥ä¸‹ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’å‚ç…§ãã ã•ã„ã€‚ put.cpp #include "libmap.h" #include int main(int argc, char *argv[]) { if (argc != 3) { std::cerr a
mogwaing 2008/05/08
c++

library

mmap

dbm
ãƒªãƒ³ã‚¯
mixi Engineersâ€™ Blog Â» æœ€é©åŒ–ã—ã‚ˆã†ï¼Ÿ
å½“ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ãƒ–ãƒã‚°ã‚’ç§ç‰©åŒ–ã—ã¦ã„ã‚‹ã¨å°‚ã‚‰ã®è©•åˆ¤ã®mikioã§ã™ã€‚ãƒ–ãƒã‚°ã‚’æ›¸ã‹ãªã„ã¨æ»ã‚“ã§ã—ã¾ã†ç—…ã«å†’ã•ã‚Œã¦ã„ã‚‹ã®ã§ã—ã‹ãŸãªã„ã§ã™ãã€‚å€‹äººãƒ–ãƒã‚°æ™‚ä»£ã‚ˆã‚Šã‚‚ã‚ã‹ã‚Šã‚„ã™ãã™ã‚‹åŠªåŠ›ã¯ã—ã¦ã„ã‚‹ã‚“ã§ã™ã‘ã©ãã€‚ã•ã¦ã€ä»Šå›žã¯ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã®æœ€é©åŒ–ã«ã‚ˆã‚‹é«˜é€ŸåŒ–ã«ã¤ã„ã¦è¿°ã¹ã¾ã™ã€‚ ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ãƒ†ã‚¹ãƒˆ TCã¯QDBMã‚„ä»–ã®DBMã‚ˆã‚Šé«˜é€Ÿã§ã‚ã‚‹ã¨ã„ã†ä¸»å¼µã‚’ã—ãŸã„ã®ã§ã™ãŒã€ãã®æ ¹æ‹ ã¨ã—ã¦ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ãƒ†ã‚¹ãƒˆã®çµæžœãŒå¿…è¦ã¨ãªã‚Šã¾ã™ã€‚ãã“ã§ã€ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã«100ä¸‡ãƒ¬ã‚³ãƒ¼ãƒ‰ã‚’æ ¼ç´ã™ã‚‹å‡¦ç†ã¨ã€ãã†ã—ã¦ä½œã£ãŸãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‹ã‚‰å…¨ã¦ã®ãƒ¬ã‚³ãƒ¼ãƒ‰ã‚’æŽ¢ç´¢ã™ã‚‹å‡¦ç†ã®æ™‚é–“ã‚’ã€å„DBMã§è¨ˆæ¸¬ã—ã¦ã¿ã¾ã—ãŸï¼ˆTCã®ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã®brosã¨ã„ã†ãƒ‡ã‚£ãƒ¬ã‚¯ãƒˆãƒªã«ãƒ†ã‚¹ãƒˆã‚³ãƒ¼ãƒ‰ãŒå…¥ã£ã¦ã„ã¾ã™ï¼‰ã€‚å®Ÿè¡Œç’°å¢ƒã¯ã€Thinkpad T60ï¼ˆIntel(R) Core2 CPU T7200 @ 2.00GHzï¼‰ä¸Šã®Linux version 2.6.16ã§ã™ã€‚ ãƒãƒƒã‚·ãƒ¥
mogwaing 2007/11/22
dbm

tokyocabinet

qdbm

benchmark
ãƒªãƒ³ã‚¯
http://takusato.net/article/bdb_oboegaki.html
mogwaing 2007/09/09
berkeleydb

dbm
ãƒªãƒ³ã‚¯
CDB
D. J. Bernstein Data structures and program structures cdb How to install cdb The cdbget program The cdbmake and cdbdump programs The cdbstats and cdbtest programs The cdb format specification The cdb-reading library interface cdb is discussed on the cdb mailing list. What is it? cdb is a fast, reliable, simple package for creating and reading constant databases. Its database structure provides se
mogwaing 2007/09/09
cdb

dbm
ãƒªãƒ³ã‚¯
æµœè¾ºã®ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹å±‹ã•ã‚“ - é–‹ç™ºãƒ¡ãƒ¢
mogwaing 2007/09/09
dbm
ãƒªãƒ³ã‚¯
ã‚¦ã‚§ãƒ–ãƒªãƒ–ãƒã‚°ï¼šã‚µãƒ¼ãƒ“ã‚¹ã¯çµ‚äº†ã—ã¾ã—ãŸã€‚
ã€Œã‚¦ã‚§ãƒ–ãƒªãƒ–ãƒã‚°ã€ã¯ 2023å¹´1æœˆ31æ—¥ ã‚’ã‚‚ã¡ã¾ã—ã¦ã‚µãƒ¼ãƒ“ã‚¹æä¾›ã‚’çµ‚äº†ã„ãŸã—ã¾ã—ãŸã€‚ 2004å¹´3æœˆã®ã‚µãƒ¼ãƒ“ã‚¹é–‹å§‹ã‚ˆã‚Š19å¹´è¿‘ãã‚‚ã®é–“ã€æ²¢å±±ã®çš†ã•ã¾ã«ã”æ„›ç”¨ã„ãŸã ãã¾ã—ãŸã“ã¨ã‚’å¿ƒã‚ˆã‚ŠãŠç¤¼ç”³ã—ä¸Šã’ã¾ã™ã€‚ä»Šå¾Œã¨ã‚‚ã€BIGLOBEã‚’ã”æ„›é¡§è³œã‚Šã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚ â€»å¼•ã£è¶Šã—å…ˆãƒ–ãƒã‚°ã¸ã®ãƒªãƒ€ã‚¤ãƒ¬ã‚¯ãƒˆã‚µãƒ¼ãƒ“ã‚¹ã¯2024å¹´1æœˆ31æ—¥ã§çµ‚äº†ã„ãŸã—ã¾ã—ãŸã€‚ BIGLOBEã®ã‚µãƒ¼ãƒ“ã‚¹ä¸€è¦§
mogwaing 2007/09/03
berkeleydb

gdbm

dbm
ãƒªãƒ³ã‚¯
mixi Engineersâ€™ Blog Â» Inside Tokyo Cabinet ãã®å¼
äºˆå®šã‚’ç«‹ã¦ãŸé€”ç«¯ã«ã‚„ã‚ŠãŸããªããªã‚‹ç—‡å€™ç¾¤ã«å ªãˆã¦é€£è¼‰ã‚’ç¶šã‘ã‚‹mikioã§ã™ï¼ˆã“ã‚“ãªç§ã§ã‚‚ã‚¨ã‚¢ãƒ¼ãƒžãƒ³ãã‚‰ã„ã¯å€’ã›ã¾ã™ï¼‰ã€‚å‰å›žã¯DBMã®åŸºæœ¬ã«ã¤ã„ã¦èª¬æ˜Žã—ã¾ã—ãŸãŒã€ãã‚Œã‚’å¿ å®Ÿã«å®Ÿè£…ã—ã¦ã‚‚å®Ÿéš›ã«ã¯ä½¿ã„ã‚‚ã®ã«ã¯ãªã‚‰ãªã„ã“ã¨ã«ã‚‚è§¦ã‚Œã¾ã—ãŸã€‚ä»Šå›žã¯ã€å®Ÿç”¨çš„ãªDBMã«é€²åŒ–ã™ã¹ãã€Tokyo Cabinetï¼ˆãŠã‚ˆã³ãã®å‰èº«ã®QDBMï¼‰ã§è€ƒãˆãŸå·¥å¤«ã«ã¤ã„ã¦ãŠè©±ã—ã¾ã™ã€‚ ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã«ã¤ã„ã¦ã‚‚ã†å°‘ã— å‰å›žã®è¨˜äº‹ã«é–¢ã—ã¦ã€ã€Œãƒãƒƒã‚·ãƒ¥é–¢æ•°ã¯ãƒ“ãƒƒãƒˆã‚·ãƒ•ãƒˆä½¿ã£ã¦å®Ÿè£…ã—ãŸæ–¹ãŒæ—©ã„ã‚ˆã€ã¨ã„ã†æ—¨ã®ãŠä¾¿ã‚Šã‚’ã„ãŸã ãã¾ã—ãŸï¼ˆã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ï¼‰ã€‚ã¾ã•ã«ãã®é€šã‚Šã§ã€ä¹—ç®—å‘½ä»¤ï¼ˆã“ã“ã§ã¯imullï¼‰ã‚ˆã‚Šå·¦ã‚·ãƒ•ãƒˆå‘½ä»¤ï¼ˆã“ã“ã§ã¯sallï¼‰ã®æ–¹ãŒé€Ÿã„ã¿ãŸã„ã§ã™ï¼ˆIntelã®è³‡æ–™ã«ã‚ˆã‚‹ã¨ã€mulãŒ15ã‹ã‚‰18ã§ã€salãŒ4ã¨ã®ã“ã¨ï¼‰ã€‚ã—ã‹ã—ã€DBMã®å ´åˆã¯ãƒ•ã‚¡ã‚¤ãƒ«I/Oã«ã‹ã‹ã‚‹æ™‚é–“ãŒæ”¯é…çš„ã«ãªã‚‹ã¨ã„ã†ã®ãŒé‡è¦ãªç‚¹ã§ã™ã€‚ã—ãŸãŒã£ã¦ã€ãƒãƒƒã‚·ãƒ¥
mogwaing 2007/08/30
dbm

mikio

mixi

database

algorithm

to see
ãƒªãƒ³ã‚¯
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ã‚’ã‚ãƒ¼ã«ã—ãŸãƒãƒƒ
mogwaing 2007/08/30
algorithm

dbm

mikio

mixi

database
ãƒªãƒ³ã‚¯
Tokyo Cabinet
Tokyo Cabinet is the successor of QDBM, a high performance database library similar to the DBM family. It also supports hash and B-tree databases and does not require any server process. The overall speed is improved compared to QDBM.
mogwaing 2007/08/30
[mikio

dbm
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸