[B! b-tree] mogwaingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

mogwaing id:mogwaing

b-treeã«é–¢ã™ã‚‹mogwaingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (24)

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

SSD ãŒã‚³ãƒ¢ãƒ‡ã‚£ãƒ†ã‚£ã«ãªã£ã¦ã‚‚çŠ¶æ³ã¯ã‹ã‚ã‚‰ãªã„ - kazuhoã®ãƒ¡ãƒ¢ç½®ãå ´
è„Šé«„åå°„ã€‚ Oracle ã‚„ MySQL ãªã©è¿‘å¹´ã® RDBMS ã¯ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«Bæœ¨ (ã®å¤‰ç¨®) ã‚’æŽ¡ç”¨ã—ã¦ã„ã¾ã™ãŒã€ãã®ç†ç”±ã¯ã“ã“ã«ã‚ã‚Šã¾ã™ã€‚ SSD ãŒã‚³ãƒ¢ãƒ‡ã‚£ãƒ†ã‚£ã«ãªã‚‹ã¨çŠ¶æ³ã¯å¤‰ã‚ã‚‹ (ä¸ç•¥) äºŒæ¬¡è¨˜æ†¶ä¸Šã§ã®æ¤œç´¢ç”¨ã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã«ã¯ã“ã‚Œã¾ã§ Bæœ¨ã®ã‚ˆã†ãªãƒ‡ã‚£ã‚¹ã‚¯ã«æœ€é©ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ãŒå¿…ç„¶çš„ã«é¸æŠžã•ã‚Œã¦ãã¾ã—ãŸãŒã€SSD ã«å¤‰ã‚ã‚‹ã¨ã€ç¾å®Ÿçš„ã«åˆ©ç”¨å¯èƒ½ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã‚‚å¹…ãŒå‡ºã¦ã€ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã«ã‚ˆã£ã¦ã¯åŠ‡çš„ãªæ”¹å–„ãŒå¯èƒ½ã«ãªã‚‹ã¨ã„ã†ã‚ã‘ã§ã™ã€‚ ã“ã®å…ˆ SSD ã®æ™®åŠã«ã‚ˆã£ã¦ã€è‰²ã€…ãªã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã§ã€é©šãã‚ˆã†ãªæ”¹å–„ãŒè¡Œã‚ã‚Œã‚‹æ©Ÿä¼šã‚’ç›®ã«ã™ã‚‹ã“ã¨ãŒå¤šããªã‚‹ã®ã§ã¯ãªã„ã‹ã¨æ€ã„ã¾ã™ã€‚ãã®æ™‚ã€å˜ã« SSD ã«å¤‰ã‚ã£ãŸã‹ã‚‰é€Ÿããªã£ãŸã¨æ‰ãˆã‚‹ã®ã§ã¯ãªãã€ã©ã®ã‚ˆã†ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ãŒé¸æŠžã•ã‚Œã¦ã€ãã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ç‰¹æ€§ãŒ SSD ã¨ã©ã®ã‚ˆã†ã«ãƒžãƒƒãƒã—ãŸã®ã‹ã¨ã„ã†è¦–ç‚¹ã§è¦‹ã¦ã„ãã“ã¨ãŒå¤§åˆ‡ã§ã¯ãªã„ã‹ã¨æ€ã„ã¾ã™ã€‚
mogwaing 2009/04/17
ssd

b-tree
ãƒªãƒ³ã‚¯
Bæœ¨ - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
æ˜¨å¹´ã‹ã‚‰ç¶šã„ã¦ã„ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³è¼ªè¬›ã‚‚ã€æ—©ã„ã‚‚ã®ã§æ¬¡ã¯18ç« ã§ã™ã€‚18ç« ã®ãƒ†ãƒ¼ãƒžã¯Bæœ¨(B Tree, Bãƒ„ãƒªãƒ¼) ã§ã™ã€‚Bæœ¨ã¯ãƒžãƒ«ãƒã‚¦ã‚§ã‚¤å¹³è¡¡æœ¨(å¤šåˆ†æœ¨ã«ã‚ˆã‚‹å¹³è¡¡æœ¨)ã§ã€ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚„ãƒ•ã‚¡ã‚¤ãƒ«ã‚·ã‚¹ãƒ†ãƒ ãªã©ã§ã‚‚è‰¯ãä½¿ã‚ã‚Œã‚‹é‡è¦ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚Bæœ¨ã¯ä¸€ã¤ã®æœ¨ã®é ‚ç‚¹ã«ã¶ã‚‰ä¸‹ãŒã‚‹æžã®æœ¬æ•°ã®ä¸‹é™ã¨ä¸Šé™ã‚’è¨ã‘ãŸä¸Šã€å¸¸ã«å¹³è¡¡æœ¨ã§ã‚ã‚‹ã“ã¨ã‚’åˆ¶ç´„ã¨ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ãªã‚Šã¾ã™ã€‚ è¼ªè¬›ã®äºˆç¿’ãŒã¦ã‚‰ã€Bæœ¨ã‚’ Python ã§å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’æœ€å¾Œã«æŽ²è¼‰ã—ã¾ã™ã€‚ä»¥ä¸‹ã¯ Bæœ¨ã«é–¢ã™ã‚‹è€ƒå¯Ÿã§ã™ã€‚ Bæœ¨ãŒãªãœé‡è¦ãªã®ã‹ Bæœ¨ãŒé‡è¦ãªã®ã¯ã€Bæœ¨(ã®å¤‰ç¨®ã§ã‚ã‚‹B+æœ¨*1ãªã©)ãŒäºŒæ¬¡è¨˜æ†¶è£…ç½®ä¸Šã§åŠ¹çŽ‡è‰¯ãæ“ä½œã§ãã‚‹ã‚ˆã†ã«è¨è¨ˆã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã ã‹ã‚‰ã§ã™ã€‚ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚’åˆ©ç”¨ã™ã‚‹ã‚¦ã‚§ãƒ–ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ãªã©ã€äºŒæ¬¡è¨˜æ†¶(ãƒãƒ¼ãƒ‰ãƒ‡ã‚£ã‚¹ã‚¯)ä¸Šã®å¤§é‡ã®ãƒ‡ãƒ¼ã‚¿ã‚’æ‰±ã†ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚’é‹ç”¨ã—ãŸçµŒé¨“ãŒã‚ã‚‹æ–¹ãªã‚‰ã€ã„ã‹ã«ãƒ‡ã‚£
mogwaing 2009/04/15
SSDã ã¨æ›¸ãè¾¼ã¿ã®æ–¹ãŒã‚ˆã‚Šå•é¡ŒãŒå¤šãã†ã§ã™ãã€‚in-place update ãŒã§ããªã„ã®ã§ã€ãã‚Œã‚’ã©ã†ã«ã‹ã£ã¦ã„ã†è©±ãŒå¤šã„æ°—ãŒã—ã¾ã™ã€‚

b-tree

algorithm
ãƒªãƒ³ã‚¯
B-Tree animation - slady
[ slady | who is slady | work ] [ ] B-tree animation This page introduces an interactive Java applet animation that demonstrates the principle of a B-Tree data structure. Main functionality is here in showing smoothly the inserting, searching, and deleting process on the btree of chosen order. Main stage This demo displays the view screen in different sizes. You can select your preffered size depe
mogwaing 2009/03/30
b-tree
ãƒªãƒ³ã‚¯
https://dl.acm.org/doi/10.1145/1326542.1326544
mogwaing 2009/01/24
This article is about a set of b-tree algorithms that respects shadowing, achieves good concurrency, and implements cloning (writeable snapshots). Our cloning algorithm is efficient and allows the creation of a large number of clones.

paper

database

b-tree

must
ãƒªãƒ³ã‚¯
https://dl.acm.org/doi/10.1145/319628.319663
mogwaing 2009/01/14
myuiã•ã‚“ã® http://www.slideshare.net/myui/blinktree-presentation/ ãŒã¨ã¦ã‚‚å‚è€ƒã«ãªã‚‹

b-tree

b*tree

b+tree

database

index

must
ãƒªãƒ³ã‚¯
CiteULike: Efficient locking for concurrent operations on B-trees
Efficient locking for concurrent operations on B-trees by: Philip L. Lehman, Bing Yao ACM Trans. Database Syst., Vol. 6, No. 4. (December 1981), pp. 650-670, doi:10.1145/319628.319663Â Key: citeulike:483052
mogwaing 2008/12/12
b-tree

lock

to see
ãƒªãƒ³ã‚¯
B-link-tree
3. B-Link Tree ã¨ã¯ (history) A variant of B*-Tree (they call) actually.. a B+-tree? (data stored in leaf only) 1981 å¹´ PHILIP.L. LEHMAN , S.BING YAO â€ Efficient Locking for Concurrent Operations on B-Trees â€ ã¨ã„ã†è«–æ–‡ã§ç™ºè¡¨ å½“æ™‚ï¼Œè¤‡æ•°ã® ãƒ—ãƒã‚»ã‚¹ ã§åŒæ™‚å®ŸåŠ¹æ€§ã‚’æŒã¤ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã®æ§‹ç¯‰ãŒæµè¡Œã‚Šã ã£ãŸ ( ã‚‰ã—ã„ è«–æ–‡ã®ä¸»çœ¼ã¯å¦‚ä½•ã«åŠ¹çŽ‡ã®ã‚ˆãé«˜ã„åŒæ™‚å®ŸåŠ¹æ€§ã‚’æœ‰ã™ã‚‹ç´¢å¼•ã‚’æ§‹ç¯‰ã™ã‚‹ã‹ï¼Ž 4. B*-Tree an elegant(?) variant on B+-tree keep pages at least 2/3 full, guaranteed . The benefit over B+
mogwaing 2008/12/11
concurrent b-tree

b-tree

must
ãƒªãƒ³ã‚¯
Hash or B-Tree
æ–°åŸŽï¼ ç‘æ³¢å¤§å¦æƒ…å ±ã§ã™ã€‚ã“ã‚“ã«ã¡ã¯ã€‚In article <[email protected]> WATANABE Katsuhiro <[email protected]> writes: > > hash ã ã¨ã€rehash ã•ã‚Œã¡ã‚ƒã†ã¨ç ´ç¶»ã—ã¾ã™ã€‚æœ€åˆã«hashã® > > å¤§ãã•ã‚’æŒ‡å®šã§ãã‚Œã°è‰¯ã„ã‚“ã§ã™ã‘ã©ãã€‚ > ä»Šæ—¥ man ã—ã¦åˆã‚ã¦ã‚ã‹ã£ãŸã‚“ã§ã™ãŒã€dbopen(3) ã‚¤ãƒ³ã‚¿ãƒ•ã‚§ãƒ¼ã‚¹ > ã®ã†ã¡ã® hash(3) åž‹ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã¯ã€hash ã®å¤§ãã•ã‚’åˆæœŸè¨å®š > ã§ãã‚‹ã¿ãŸã„ã§ã™ã€‚ãã—ã¦ä»Šã® dbm ã¯ã€ã‚‚ã¯ã‚„ç‹¬ç«‹ã—ãŸå®Ÿè£…ã§ã¯ > ãªãã€dbopen/hash ã® wrapper ã«ãªã£ã¦ã„ã‚‹ã¨ã‚ã‹ã‚Šã¾ã—ãŸã€‚ ç§ã¯ã€Berkeley DB ã§ã€ãªã‚“ã¨ãªã B æœ¨ã°ã‹ã‚Šä½¿ã£ã¦ã„ã¾ã™ã€‚ãƒãƒƒ ã‚·ãƒ¥ã‚‚ä½¿ãˆã‚‹ã‘ã©ã€‚B æœ¨ã§ã‚‚ã€400 ä¸‡ä»¶ãã‚‰ã„å¹³æ°—ã§ã™ã€‚B
mogwaing 2008/12/04
çµæ§‹é©å½“ãªè°è«–ã‚‚æ··ã–ã£ã¦ã‚‹ã‘ã©

hash

b-tree
ãƒªãƒ³ã‚¯
A Diary Which Heads for Convergence (Naist branch).(2007-08-13)
ãƒ†ã‚ã‚¹ãƒˆç´¢å¼•ãƒ‘ãƒˆãƒªã‚·ã‚¢æœ¨ã‚’ä½œã‚Šçµ‚ãˆã¦ï¼Œä»Šåº¦ã¯String B-Treeã®å®Ÿè£…ã—ã¦ã„ãŸã‚“ã ã‘ã©ï¼ŒéšŽå±¤åŒ–ãƒ‘ãƒˆãƒªã‚·ã‚¢æœ¨ã§ã‚‚è‰¯ã„ã®ã‹ãªã£ã¨ã‹suffixæœ¨ã®éšŽå±¤åŒ–ã®è©±ã§è‰¯ã„ã®ãŒææ¡ˆã•ã‚Œã¦ã‚‹ã‹ã‚‚...ã¨æ°—ã«ãªã£ã¦ï¼ŒCPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequencesã¨ã„ã†è«–æ–‡ã‚’èªã‚“ã§ãŸã€‚çµè«–ã¨ã—ã¦ã¯String B-Treeã§è‰¯ã„ã‚„ï¼Œãªã‚“ã ã‘ã©ã€‚ Suffix Treeã‚’ç´ ç›´ã«ãƒšãƒ¼ã‚¸ã‚µã‚¤ã‚ºã”ã¨ã«åˆ‡ã£ã¦ï¼Œå°‘ã—å·¥å¤«ã—ã¾ã—ãŸã¨ã„ã†ã‚ˆã†ãªãŠè©±ã€‚ICDE2007ãªã‚“ã ã‘ã©ï¼Œ2007å¹´ã¾ã§suffix treeã®äºŒæ¬¡è¨˜æ†¶ã¸ã®æ ¼ç´ã®è©±ãŒã‚ã‚“ã¾ã‚Šã•ã‚Œã¦ã„ãªã„ã“ã¨ã«é©šãã€‚ç´¢å¼•æ§‹ç¯‰ã¨ä¸»è¨˜æ†¶ã«åŽã¾ã‚‹ã‚ˆã†ã«æ¥µå°è¡¨ç¾ã‚’è€ƒãˆãŸã‚Šï¼Œä¸»è¨˜æ†¶ä¸Šã®è©±ãŒä¸»ã«ç ”ç©¶èª²é¡Œã§ã‚ã£ãŸã‚ˆã†ã ã€‚ æ‚ªããªã„è«–æ–‡ãªã‚“ã ã‘ã©
mogwaing 2008/12/04
index

b-tree

patricia tree

research

to see
ãƒªãƒ³ã‚¯
https://dl.acm.org/doi/10.1145/564691.564753
mogwaing 2008/12/04
database

index

b-tree

research

must

acm

paper
ãƒªãƒ³ã‚¯
DO++: å·¦å‚¾èµ¤é»’æœ¨
æ¼¢å—ã§æ›¸ãã¨ä»°ã€…ã—ã„ãŒã€èµ¤é»’æœ¨ (wikipedia) red-black tree (english wikipedia)ã¨ã„ã†å¹³è¡¡äºŒåˆ†æœ¨ã§æœ€ã‚‚å¤šãã¤ã‹ã‚ã‚Œã¦ã„ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ã€æ”¹å–„ç‰ˆãŒå‡ºã¦ãŸãã†ã ã€‚ left-leaning red-black tree (pdf) æ—¥æœ¬èªžã«è¨³ã™ã¨å·¦å‚¾èµ¤é»’æœ¨ã‹ãªã€‚ç°¡å˜ãªæ¼¢å—ã‚’ä¸¦ã¹ã¦ã„ã‚‹æ„Ÿã˜ãŒã—ã¦ã—ã¾ã† èµ¤é»’æœ¨ã®è©³ç´°ã«ã¤ã„ã¦ã¯ã€wikipediaãªã©ã‚’ã‚ˆã‚“ã§ã‚‚ã‚‰ã†ã¨ã—ã¦ã€ã“ã‚Œã¯æ›´æ–°æ™‚é–“ãŒå®šæ•°ã§æ›´æ–°ç®‡æ‰€ãŒå±€æ‰€çš„ï¼ˆã“ã‚Œã¯ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ã¨ã‹ã§ãƒãƒƒã‚¯ã™ã‚‹ç®‡æ‰€ã‚’ã‹ãªã‚Šç´°ã‹ã„å˜ä½ã§ã€ã§ãã‚‹ã¨ã„ã†å¼·ã„åˆ©ç‚¹ã‚‚ã‚ã‚‹ï¼‰ã®ã ãŒã€å®Ÿè£…ãŒçµæ§‹é¢å€’ãã•ã„ã€‚ä¾‹ãˆã°C++ stl ã®mapã¨ã‹ã®èµ¤é»’æœ¨ã®å®Ÿè£…ã®stl_tree.h(google code search)ã¯å¤§å¤‰ãªã“ã¨ã«ãªã£ã¦ã„ã‚‹ï¼ˆç‰¹ã«Rb_tree_rebalance_for_eraseã¨ã‹ï¼‰ èµ¤é»’æœ¨ã¨ã„ã†ã®ã¯å‹•çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€
mogwaing 2008/11/08
algorithm

b-tree

redblacktree
ãƒªãƒ³ã‚¯
DSJ : Vol. 5 (2006) , No. 0 pp.143-161
Mehedi Masud1), Gopal Chandra Das2), Anisur Rahman3) and Arunashis Ghose4) 1) School of Information Techno logy and Engineering, University of Ottawa 2) Computer Science and Automation, Indian Institute of Science 3) Computer Science and Engineering, Khulna University 4) Department of Telecommunication and Signal Processing, Blekinge Institute of Techno logy Abstract It is always a major demand to p
mogwaing 2008/11/05
b-tree

hash

paper
ãƒªãƒ³ã‚¯
https://dl.acm.org/citation.cfm?id=847244
mogwaing 2008/10/01
paper

database

b-tree
ãƒªãƒ³ã‚¯
Google Scholar
èªã¿è¾¼ã‚“ã§ã„ã¾ã™...ç¾åœ¨ã‚·ã‚¹ãƒ†ãƒ ã§å‡¦ç†ã‚’å®Ÿè¡Œã§ãã¾ã›ã‚“ã€‚ã—ã°ã‚‰ãã—ã¦ã‹ã‚‰ã‚‚ã†ä¸€åº¦ãŠè©¦ã—ãã ã•ã„ã€‚å¼•ç”¨æ¤œç´¢ã‚ªãƒ—ã‚·ãƒ§ãƒ³æ¤œç´¢æ¡ä»¶ã™ã¹ã¦ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’å«ã‚€ãƒ•ãƒ¬ãƒ¼ã‚ºã‚’å«ã‚€ã„ãšã‚Œã‹ã®ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’å«ã‚€ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã‚’å«ã¾ãªã„æ¤œç´¢å¯¾è±¡ã«ã™ã‚‹ç®‡æ‰€è¨˜äº‹å…¨ä½“è¨˜äº‹ã®ã‚¿ã‚¤ãƒˆãƒ«è‘—è€…ã‚’æŒ‡å®š:ä¾‹: "æ¹¯å·ç§€æ¨¹"ã€æœæ°¸å‡ºå…¸ã‚’æŒ‡å®š:ä¾‹: ç‰©ç†å¦ä¼šã€Natureæ—¥ä»˜ã‚’æŒ‡å®š:Â â€”Â ä¾‹: 1996ãƒžã‚¤ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã«ä¿å˜ã—ã¾ã—ãŸå®Œäº†è«–æ–‡ã‚’å‰Šé™¤è¨˜äº‹ãƒ—ãƒãƒ•ã‚£ãƒ¼ãƒ«ãƒ—ãƒãƒ•ã‚£ãƒ¼ãƒ«ãƒžã‚¤ ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚¢ãƒ©ãƒ¼ãƒˆçµ±è¨ˆæƒ…å ±æ¤œç´¢ã‚ªãƒ—ã‚·ãƒ§ãƒ³è¨å®šãƒã‚°ã‚¤ãƒ³ãƒã‚°ã‚¤ãƒ³è¨˜äº‹Scholarãƒ—ãƒãƒ•ã‚£ãƒ¼ãƒ«ãƒžã‚¤ ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã™ã¹ã¦ã®ç‰ˆè©²å½“ã™ã‚‹è¨˜äº‹ãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ ãƒ—ãƒ©ã‚¤ãƒã‚·ãƒ¼è¦ç´„ãƒ˜ãƒ«ãƒ—Google Scholar ã«ã¤ã„ã¦ãƒ˜ãƒ«ãƒ—ã‚’æ¤œç´¢
mogwaing 2008/08/09
b-tree

b+tree

algorithm

1
ãƒªãƒ³ã‚¯
http://www.t3.rim.or.jp/~matsuuch/COMP/btree.htm
ã¨ã„ã†å¤§å°é–¢ä¿‚ã«ãªã£ã¦ã„ã¾ã™ã€‚ã¾ãŸã€ãƒšãƒ¼ã‚¸ã‚’æŒ‡ã—ã¦ã„ãªã„branchã¯ã€NULLå€¤ã«ãªã£ã¦ã„ã¾ã™ã€‚ åŽ³å¯†ã«è¨€ã†ã¨ãƒšãƒ¼ã‚¸ã¯ã€æ¬¡ã®ã‚ˆã†ãªã‚ãƒ“ã—ã„æ¡ä»¶ã‚’æº€ãŸã—ã¾ã™ã€‚ãƒšãƒ¼ã‚¸ï¼‘ã¤ã«ã¤ã„ã¦ã®ã‚ãƒ¼ã®å€‹æ•°ãŒæœ€å¤§2Må€‹ã ã¨ã™ã‚‹ã¨ã€ ãƒšãƒ¼ã‚¸å½“ãŸã‚Šã®ã‚ãƒ¼ã®å€‹æ•°n ã¯ M â‰¦ n â‰¦ 2M ã‚’æº€ãŸã™ã€‚ã¤ã¾ã‚Šã€å„ãƒšãƒ¼ã‚¸ã¯å°‘ãªãã¨ã‚‚åŠåˆ†åŸ‹ã¾ã£ã¦ã„ãªã‘ã‚Œã°ã„ã‘ãªã„ã€‚ãŸã ã—ã€æ ¹ï¼ˆä¸€ã¤ã ã‘ã‚ã‚‹ï¼‰ã«ã¤ã„ã¦ã¯ 0 â‰¦ n â‰¦ 2 Mã§ã‚ˆã„ã€‚ å„ãƒšãƒ¼ã‚¸ä¸Šã®ã‚ãƒ¼ã¯æ˜‡é †ã«ãªã‚‰ã¹ã‚‹ï¼ˆ key[0] ï¼œ key[1] ï¼œâ€¦ï¼œ key[n-1] ï¼‰ ãƒã‚¤ãƒ³ã‚¿ branch[k] ï¼ˆ k ï¼ž 0 ï¼‰ã®æŒ‡ã™ãƒšãƒ¼ã‚¸ãŒå«ã‚€ã™ã¹ã¦ã®ã‚ãƒ¼ã¯ key[k-1] ã‚ˆã‚Šå¤§ãã„ ãƒã‚¤ãƒ³ã‚¿ branch[k] ï¼ˆ k ï¼œ n ï¼‰ã®æŒ‡ã™ãƒšãƒ¼ã‚¸ãŒå«ã‚€ã™ã¹ã¦ã®ã‚ãƒ¼ã¯ key[k] ã‚ˆã‚Šå°ã•ã„ æœ¨ã®é«˜ã•ã¯ã„ãŸã‚‹ã¨ã“ã‚ä¸€å®šã€‚ã¤ã¾ã‚Šã€æ ¹ã‹ã‚‰æœ«ç«¯ã®ãƒšãƒ¼ã‚¸ï¼ˆè‘‰ï¼‰ã«è‡³ã‚‹ãƒã‚¤ãƒ³ã‚¿
mogwaing 2008/07/30
b-tree

algorithm

data structure

1
ãƒªãƒ³ã‚¯
https://dl.acm.org/citation.cfm?id=301973
mogwaing 2008/07/27
b-tree

inverted index

paper

1
ãƒªãƒ³ã‚¯
DBH - Disk Based Hashtables
The homepage of the DBH project has moved to http://www.gnu.org/software/libdbh/ as it is now official GNU software.
mogwaing 2008/04/22
data structure

algorithm

hash

b-tree
ãƒªãƒ³ã‚¯
http://www.inf.unibz.it/dis/teaching/DMS/lecturenotes/dms03.pdf
mogwaing 2007/09/03
ã‚ˆãã¾ã¨ã¾ã£ã¦ã„ã‚‹ã€‚å¾Œã§èªã‚€

data structure

algorithm

b+tree

b-tree

hash

extendible hashing

linear hashing

to see
ãƒªãƒ³ã‚¯
B-Tree ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ - ã‚ªãƒ©ã‚¯ãƒ«ãƒ»Oracleã‚’ãƒžã‚¹ã‚¿ãƒ¼ã™ã‚‹ãŸã‚ã®åŸºæœ¬ã¨ä»•çµ„ã¿
B-Tree ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ (B-Tree Index) ã‚ªãƒ©ã‚¯ãƒ«ã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã€ã™ãªã‚ã¡ã€ãƒ‡ãƒ•ã‚©ãƒ«ãƒˆæ™‚ã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã¯ B-Tree ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹(â€»1) ã«ãªã‚‹ã€‚ B-Tree ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã¨ã¯ãƒãƒ©ãƒ³ã‚¹ãƒ‰ãƒ»ãƒ„ãƒªãƒ¼ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã®ç•¥ã§ã‚ã‚‹(1969 å¹´é ƒã«æ—¢ã«è€ƒæ¡ˆã•ã‚Œã¦ã„ã‚‹)ã€‚ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’å§‹ã‚ãŸã¨ãã«ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§å‹‰å¼·ã—ãŸã§ã‚ã‚ã†ã¨æ€ã†äºŒåˆ†æœ¨ (Binary-Tree) ã®é€²åŒ–ç‰ˆã¿ãŸã„ãªã‚‚ã®ã§ã‚ã‚‹ã€‚ ä¸€éƒ¨ã®ãƒ–ãƒ©ãƒ³ãƒãŒç•°å¸¸ã«æˆé•·ã—ãªã„ã‚ˆã†ã«å¹³è¡¡ã‚’ä¿ã¤ã‚ˆã†ã«å†ç·¨æˆ(ãƒãƒ©ãƒ³ã‚¹)ã™ã‚‹ä»•çµ„ã¿ã«ã‚ˆã£ã¦ã€å¸¸ã«ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã«ã‚ˆã‚‹æ¤œç´¢æ€§èƒ½ã‚’é«˜ã„çŠ¶æ…‹ã«ä¿ã¤ã“ã¨ãŒã§ãã‚‹(â€»2)ã€‚ RDBMS ã«ã‚ˆã£ã¦ã¯è‰²ã€…ãªç¨®é¡žã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ãŒå˜åœ¨ã—ã¦ã„ã‚‹ãŒã€ç¾åœ¨ã«ãŠã„ã¦ã‚‚ B-Tree ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ãŒå¤šãã®ã‚±ãƒ¼ã‚¹ã§å„ªã‚ŒãŸãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ã‚’å‡ºã—ã¦ã„ã‚‹ã“ã¨ã«ã¯å¤‰ã‚ã‚Šãªã„ã‚ˆã†ã§ã‚ã‚‹ã€‚ (â€»1) B-Tree ã«
mogwaing 2007/03/08
b-tree
ãƒªãƒ³ã‚¯
Managed Cloud, Cloud Migration and Adoption â€“ Carbon60
Hybrid Cloud Partner End-to-End Hybrid Cloud Solutions Strategy Transf ormation Resilience Leverage our flexible, managed hybrid cloud solutions to ensure your workloads are available and secureâ€”anywhere. Partner with Carbon60 to accelerate innovation and focus on what drives your business. About Carbon60 We Help Organizations Manage Cloud Environments With Ease In todayâ€™s dynamic techno logy landsc
mogwaing 2007/02/14
b-tree
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸