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

mogwaing id:mogwaing

double arrayã«é–¢ã™ã‚‹mogwaingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (7)

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

ãƒ€ãƒ–ãƒ«é…åˆ—ã«ãŠã‘ã‚‹å‹•çš„æ›´æ–°ã®åŠ¹çŽ‡åŒ–ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ | CiNii Research
ã‚¿ã‚¤ãƒˆãƒ«åˆ¥å ãƒ€ãƒ–ãƒ« ãƒã‚¤ãƒ¬ãƒ„ ãƒ‹ ã‚ªã‚±ãƒ« ãƒ‰ã‚¦ãƒ†ã‚ ã‚³ã‚¦ã‚·ãƒ³ ãƒŽ ã‚³ã‚¦ãƒªãƒ„ã‚« ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ Efficient Dynamic Update Algorithms for a Double-array Structure è‡ªç„¶è¨€èªžå‡¦ç† ãƒˆãƒ©ã‚¤æ§‹é€ ã¯ã‚ãƒ¼ã®è¡¨è¨˜æ–‡å—å˜ä½ã«æ§‹æˆã•ã‚ŒãŸæœ¨æ§‹é€ ã‚’ç”¨ã„ã¦æ¤œç´¢ã™ã‚‹ã‚ãƒ¼æ¤œç´¢æŠ€æ³•ã®1ã¤ã§ã‚ã‚Šï¼Œè‡ªç„¶è¨€èªžè¾žæ›¸ã‚’ä¸å¿ƒã¨ã—ã¦åºƒãç”¨ã„ã‚‰ã‚Œã¦ã„ã‚‹ï¼Žã“ã®ãƒˆãƒ©ã‚¤æ§‹é€ ã‚’å®Ÿç¾ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã—ã¦é«˜é€Ÿæ€§ã¨ã‚³ãƒ³ãƒ‘ã‚¯ãƒˆæ€§ã‚’æº€è¶³ã™ã‚‹ãƒ€ãƒ–ãƒ«é…åˆ—æ³•ãŒã‚ã‚‹ãŒï¼Œã“ã®æ‰‹æ³•ã¯ï¼Œã‚ãƒ¼ã®æ›´æ–°ãŒé »ç¹ã«ç”Ÿã˜ãªã„æ¤œç´¢æ³•ã¨ã—ã¦ç¢ºç«‹ã—ã¦ã„ã‚‹ãŸã‚ï¼Œå‹•çš„æ¤œç´¢æ³•ã«æ¯”ã¹ã¦è¿½åŠ æ™‚é–“ã¯é«˜é€Ÿã§ã‚ã‚‹ã¨ã¯ã„ãˆãšï¼Œã¾ãŸå‰Šé™¤ã§ç”Ÿã˜ã‚‹ä¸è¦ãªãƒŽãƒ¼ãƒ‰ã‚„æœªä½¿ç”¨è¦ç´ ã«ã‚ˆã‚Šè¨˜æ†¶é‡ã«ç„¡é§„ãŒç”Ÿã˜ã¦ã„ãŸï¼Žæœ¬è«–æ–‡ã§ã¯ã“ã‚Œã‚‰ã®å•é¡Œã‚’è§£æ±ºã—ï¼Œãƒ€ãƒ–ãƒ«é…åˆ—ã‚’å‹•çš„æ¤œç´¢æ³•ã¨ã—ã¦ç¢ºç«‹ã™ã‚‹ãŸã‚ï¼Œæœªä½¿ç”¨è¦ç´ ã‚’é€£çµã™ã‚‹ã“ã¨ã§è¿½åŠ å‡¦ç†ã‚’é«˜é€ŸåŒ–ã™ã‚‹æ‰‹æ³•ï¼Œå‰Šé™¤æ™‚ã«ç”Ÿã˜ã‚‹ä¸è¦ãƒŽ
mogwaing 2009/01/15
Efficient Dynamic Update Algorithms for a Double-array Structure . ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ï¼ > id:naoya

double array

algorithm

data structure

to see
ãƒªãƒ³ã‚¯
ã“ã‚Œã‹ã‚‰ã®Double Arrayã¯å‹•çš„æ›´æ–°ã«å¯¾å¿œã™ã‚‹ã¹ã - å°„æ’ƒã—ã¤ã¤å‰è»¢ æ”¹
Double Arrayã®ã‚³ãƒ¼ãƒ‰ãªã‚“ã¦1å¹´ä»¥ä¸Šã„ã˜ã£ã¦ãªã„ãã›ã«ãªã«ã‚’è¨€ã£ã¦ã‚‹ã‚“ã ã“ã®å£ã¯ã¨è¨€ã†æ„Ÿã˜ã§ã™ãŒã€Double Arrayã‚’ä½œã‚‹ã®ã§ã‚ã‚Œã°ã€å‹•çš„æ›´æ–°ã«å¯¾å¿œã•ã›ã‚‹ã¹ãã§ã‚ã‚‹ã¨ã€ãã†æ€ã†ã‚ã‘ã§ã™ã€‚ Double Arrayã®ãƒ¡ãƒªãƒƒãƒˆã¯ Trieã§ã‚ã‚‹ é€Ÿã„ (Ternary Search Treeã¨ã‹ã¨æ¯”ã¹ã‚‹ã¨)ã‚µã‚¤ã‚ºã‚‚å°ã•ã„ ã¨ã„ã†æ„Ÿã˜ã ã£ãŸè¨³ã§ã™ãŒã€é€Ÿåº¦ã¯ã¨ã‚‚ã‹ãã€ã‚µã‚¤ã‚ºã§ã¯TxãŒä½¿ã£ã¦ã„ã‚‹ã‚ˆã†ãªLOUDSã‚„LOUDS++ãªã©ã®åœ§ç¸®ã—ã¡ã‚ƒã†æ–¹å¼ã«å‹ã¦ãªã„ã®ã§ã€é™çš„ãªè¾žæ›¸ã¨ã—ã¦ã¯ã€é€Ÿåº¦ãŒè¶…é‡è¦ãªã¨ã“ã‚ä»¥å¤–ã§ã¯LOUDSã‚„LOUDS++ã‚’ä½¿ã£ãŸè¾žæ›¸ã‚’ä½¿ã†ã®ãŒã„ã„ã®ã‹ãªã¨æ€ã†è¨³ã§ã™ã€‚è¾žæ›¸å¼•ãä»¥å¤–ã®éƒ¨åˆ†ãŒãƒœãƒˆãƒ«ãƒãƒƒã‚¯ã§ã‚ã‚‹ã“ã¨ã‚‚å¤šã„ã ã‚ã†ã—ãã€‚ ã¨è¨€ã†ã‚ã‘ã§ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«æ¯”è¼ƒã—ã¦Double Arrayã§ãªã«ã‹ä¾¿åˆ©ãªäº‹ãŒã§ããªã„ã‹ãªã¨ã„ã†ã¨ã€åœ§ç¸®ã‚’ã‹ã‘ã‚‹æ–¹å¼ã§ã¯ã‚„ã¯ã‚Šã€å‹•çš„ãªæ›´æ–°ãŒé›£
mogwaing 2009/01/15
å‹•çš„ã«æ›´æ–°å¯èƒ½ãªdouble array ã£ã¦ä»Šã¯ãªã„ã‚“ã ã£ã‘ï¼Ÿ

double array

algorithm

trie

data structure
ãƒªãƒ³ã‚¯
Double-Array
ãƒ€ãƒ–ãƒ«é…åˆ—ï¼ˆ Double-Array ï¼‰ã¯ï¼Œ ãƒˆãƒ©ã‚¤ï¼ˆ Trie ï¼‰ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ç¨®ã§ã‚ã‚Šï¼Œ å°ã•ã„è¾žæ›¸ã§é«˜é€Ÿã«æ¤œç´¢ã§ãã‚‹ã¨ã„ã†ç‰¹é•·ã‚’æŒã£ã¦ã„ã¾ã™ï¼Ž å®Ÿéš›ã«ï¼ŒèŒ¶çŒï¼ˆ ChaSen ï¼‰ã‚„ å’Œå¸ƒè•ªï¼ˆ MeCab ï¼‰ãªã©ã® å½¢æ…‹ç´ è§£æžå™¨ã§åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ã¨ã„ã†å®Ÿç¸¾ãŒã‚ã‚Šã¾ã™ï¼Ž ãƒ€ãƒ–ãƒ«é…åˆ—ã§ã¯ï¼Œé…åˆ—ã‚’ä½¿ã£ã¦ãƒˆãƒ©ã‚¤ã‚’è¡¨ç¾ã—ã¾ã™ï¼Ž é…åˆ—ã®å„è¦ç´ ãŒ BASE, CHECK ã¨ã„ã†äºŒã¤ã®æ•´æ•°ã‚’æŒã¤ã®ã§ï¼Œé æ–‡å—ã‚’ã¨ã£ã¦é…åˆ— BC ã¨å‘¼ã¶ã“ã¨ã«ã—ã¾ã™ï¼Ž ä»¥é™ã®èª¬æ˜Žã§ã¯ï¼Œé…åˆ— BC ã®è¦ç´ x ã® BASE, CHECK ã‚’ ãã‚Œãžã‚Œ BC[x].BASE, BC[x].CHECK ã¨è¨˜è¿°ã—ã¾ã™ï¼Ž é€šå¸¸ï¼ŒBASE, CHECK ã¯å€‹åˆ¥ã®é…åˆ—ã¨ã—ã¦ç´¹ä»‹ã•ã‚Œã¾ã™ãŒï¼Œ ç‰¹ã«åˆ†å‰²ã—ã¦è€ƒãˆã‚‹å¿…è¦ãŒãªã„ã®ã§ï¼Œã“ã®ã‚ˆã†ãªèª¬æ˜Žã«ã—ã¾ã—ãŸï¼Ž åŸºæœ¬çš„ã«ï¼Œé…åˆ— BC ã®å„è¦ç´ ã¯ ãƒˆãƒ©ã‚¤ã®ç¯€ã¨ä¸€å¯¾ä¸€ã§å¯¾å¿œã—ã¾ã™ï¼Ž ãã®ãŸã‚ï¼Œå¯¾å¿œã™ã‚‹
mogwaing 2008/09/20
algorithm

trie

double array

must
ãƒªãƒ³ã‚¯
Double Arrayã®éžå¸¸ã«åŠ¹çŽ‡çš„ãªåœ§ç¸® - å°„æ’ƒã—ã¤ã¤å‰è»¢ æ”¹
ã€Œãƒ€ãƒ–ãƒ«é…åˆ—ã«ãŠã‘ã‚‹ã‚ãƒ£ãƒƒã‚·ãƒ¥ã®åŠ¹çŽ‡åŒ–ã€ã¨ã„ã†è«–æ–‡ã‚’è¦‹ä»˜ã‘ãŸã€‚FIT2006ã¨ã„ã†ãƒ•ã‚©ãƒ¼ãƒ©ãƒ ã§ç™ºè¡¨ã•ã‚ŒãŸã‚‚ã®ã‚‰ã—ã„ã€‚ã“ã‚Œã¯ã™ã”ã„ã€‚ç›®ã‹ã‚‰é±—ãŒè½ã¡ãŸã€‚ãªã‚“ã‹ãƒªãƒ³ã‚¯å¼µã£ã¦è‰¯ã„ã‚‚ã®ã‹è¿·ã†ã®ã§ã€ã¨ã‚Šã‚ãˆãšã¯ãƒªãƒ³ã‚¯ã—ãªã„ã€‚ ã“ã®è«–æ–‡ã«æ›¸ã„ã¦ã‚ã‚‹ã“ã¨ã¯2ã¤ã‚ã£ã¦ã€ã²ã¨ã¤ã¯é…åˆ—ã‚µã‚¤ã‚ºã®å‰Šæ¸›ã§ã€ã‚‚ã†ã²ã¨ã¤ã¯ã§ãã‚‹ã ã‘ã‚ãƒ£ãƒƒã‚·ãƒ¥ãƒŸã‚¹ã‚’æ¸›ã‚‰ã™ãŸã‚ã®æ–¹æ³•ã§ã‚ã‚‹ã€‚é…åˆ—ã‚µã‚¤ã‚ºã‚’å‰Šæ¸›ã™ã‚‹ãŸã‚ã®æ–¹æ³•ãŒã™ã”ã„ã€‚ã“ã‚Œã¾ã§èª°ã‚‚è€ƒãˆä»˜ã‹ãªã‹ã£ãŸã®ã‹ã€ãã‚Œã¨ã‚‚è€ƒãˆä»˜ã„ãŸã‘ã©ã‚„ã‚‰ãªã‹ã£ãŸã®ã‹ï¼Ÿ ã¾ãšã€checkã®è¦ç´ ã‚µã‚¤ã‚ºã¯1byteã§ååˆ†ã§ã‚ã‚‹ã€‚ãªãœãªã‚‰ã€é·ç§»å…ƒã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ãŒã‚ã‹ã‚‰ãªãã¦ã‚‚ã€é·ç§»ã«ä½¿ã£ãŸã‚ãƒ¼ã®å€¤ãŒã‚ã‹ã‚Œã°ååˆ†ãªã®ã§ã€‚ã“ã‚Œã§DoubleArrayå…¨ä½“ã®ã‚µã‚¤ã‚ºã‚’5/8ã«æ¸›ã‚‰ã›ã‚‹ã€‚ã¾ãŸã€æ™®é€šã€1GBã®Double Arrayã‚’ä½œæˆã—ãŸã‚Šã™ã‚‹ã“ã¨ã¯ç„¡ã„ï¼ˆã›ã„ãœã„100MBç¨‹åº¦ã ã‚ã†ï¼‰ã®ã§ã€Baseã«ã‚‚4byteã‚‚å‰²ã‚Šå½“
mogwaing 2008/09/20
algorithm

trie

double array

to see
ãƒªãƒ³ã‚¯
An Implementation of Double-Array Trie
Contents What is Trie? What Does It Take to Implement a Trie? Tripple-Array Trie Double-Array Trie Suffix Compression Key Insertion Key Deletion Double-Array Pool Allocation An Implementation Download Other Implementations References What is Trie? Trie is a kind of digital search tree. (See [Knuth1972] for the detail of digital search tree.) [Fredkin1960] introduced the trie terminology, which is
mogwaing 2008/09/20
trie

double array

algorithm

must
ãƒªãƒ³ã‚¯
Tiny Double-Array Library
ãƒ€ãƒ–ãƒ«é…åˆ— ï¼ˆ Double-Array ï¼‰ ã¨ã¯ï¼Œ ãƒˆãƒ©ã‚¤ ï¼ˆ Trie ï¼‰ ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ã¤ã§ï¼Œ ã€Œå°ã•ã„è¾žæ›¸ã§é«˜é€Ÿãªæ¤œç´¢ã€ãŒç‰¹é•·ã«ãªã‚Šã¾ã™ï¼Ž ãƒˆãƒ©ã‚¤ã‚’è¡¨ç¾ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã‹ã‚‰ï¼Œ ã€Œå…¥åŠ›æ–‡å—åˆ—ã®å‰æ–¹éƒ¨åˆ†åˆ—ã¨ä¸€è‡´ã™ã‚‹ã‚ãƒ¼ã®æ¤œç´¢ã€ãŒå¯èƒ½ã§ã™ï¼Ž ä½¿ã„æ–¹ã¨ã—ã¦ã¯ï¼Œãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã‚„æ§‹æ–‡è§£æžï¼Œå½¢æ…‹ç´ è§£æžãªã©ãŒã‚ã‚Šã¾ã™ï¼Ž ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã¨ã—ã¦ã¯ï¼ŒãŠãã‚‰ã Darts ãŒæœ‰åã§ã™ï¼Ž Darts: Double-ARay Trie System TinyDA ã¯ï¼Œ Darts ã«å½±éŸ¿ã•ã‚Œã¦ä½œæˆã—ãŸãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã™ï¼Ž ã‚ãƒ¼ã‚’æ•´åˆ—ã—ã¦è¾žæ›¸ã«ä¸€æ‹¬ç™»éŒ²ã™ã‚‹ã‚ˆã†ã«ãªã£ã¦ã„ã¦ï¼Œ ãƒ¬ã‚³ãƒ¼ãƒ‰ã«ã¤ã„ã¦ã¯ï¼Œåž‹ã‚’ç‰¹å®šã›ãšï¼Œé ˜åŸŸã ã‘ã‚’ç¢ºä¿ã™ã‚‹ã‚ˆã†ã«ãªã£ã¦ã„ã¾ã™ï¼Ž ãã®ãŸã‚ï¼Œè¾žæ›¸ã‚’ä½œæˆã—ãŸå¾Œã§ã‚ãƒ¼ã‚’è¿½åŠ ã™ã‚‹ã“ã¨ã¯ã§ãã¾ã›ã‚“ãŒï¼Œ ãƒ¬ã‚³ãƒ¼ãƒ‰ã‚’å¤‰æ›´ã™ã‚‹ã“ã¨ã¯å¯èƒ½ã§ã™ï¼Ž ãŸã ã—ï¼Œãƒ¬ã‚³ãƒ¼ãƒ‰ã‚’å¤‰æ›´ã™ã‚‹å ´åˆã¯ï¼Œ æ›¸ãè¾¼ã‚€é ˜åŸŸã‚’èª¤ã‚‹ã¨è¾žæ›¸ãŒç ´æã—
mogwaing 2008/04/24
trie

double array

darts
ãƒªãƒ³ã‚¯
Dynamic Double-Array Library
ãƒ€ãƒ–ãƒ«é…åˆ— ï¼ˆ Double-Array ï¼‰ ã¨ã¯ï¼Œ ãƒˆãƒ©ã‚¤ ï¼ˆ Trie ï¼‰ ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ã¤ã§ï¼Œ ã€Œå°ã•ã„è¾žæ›¸ã§é«˜é€Ÿãªæ¤œç´¢ã€ãŒç‰¹é•·ã«ãªã‚Šã¾ã™ï¼Ž ãƒˆãƒ©ã‚¤ã‚’è¡¨ç¾ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã‹ã‚‰ï¼Œ ã€Œå…¥åŠ›æ–‡å—åˆ—ã®å‰æ–¹éƒ¨åˆ†åˆ—ã¨ä¸€è‡´ã™ã‚‹ã‚ãƒ¼ã®æ¤œç´¢ã€ãŒå¯èƒ½ã§ã™ï¼Ž ä½¿ã„æ–¹ã¨ã—ã¦ã¯ï¼Œãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã‚„æ§‹æ–‡è§£æžï¼Œå½¢æ…‹ç´ è§£æžãªã©ãŒã‚ã‚Šã¾ã™ï¼Ž ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã¨ã—ã¦ã¯ï¼ŒãŠãã‚‰ã Darts ãŒæœ‰åã§ã™ï¼Ž Darts: Double-ARay Trie System
mogwaing 2008/04/10
data structure

double array
ãƒªãƒ³ã‚¯
1