hiroyukimã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ / 2013å¹´9æœˆ12æ—¥

å®Ÿã¯ã‚¨ã‚°ã™ãŽã‚‹ã‚¤ãƒ«ã‚«ã®ç”Ÿæ…‹ - ãƒ©ã‚¤ãƒ–ãƒ‰ã‚¢ãƒ‹ãƒ¥ãƒ¼ã‚¹

by ãƒ©ã‚¤ãƒ–ãƒ‰ã‚¢ãƒ‹ãƒ¥ãƒ¼ã‚¹ç·¨é›†éƒ¨ ã–ã£ãã‚Šè¨€ã†ã¨ ã‚¤ãƒ«ã‚«ã¯æ„›å¬ŒãŒã‚ã‚Šã€é ãŒã„ã„ã¨ã„ã†ã‚¤ãƒ¡ãƒ¼ã‚¸ãŒã‚ã‚‹ ã—ã‹ã—ã€å®Ÿéš›ã¯å‡¶æš´ã§ã€ä»–ã®å‹•ç‰©ã‚ˆã‚Šé ãŒã„ã„ã¨ã„ã†ã‚ã‘ã§ãªã„ã¨ã„ã† è‹±ã®ç ”ç©¶è€…ãŒã€é›„ã‚¤ãƒ«ã‚«ãŒåŒæ€§ã‚’å¨åœ§ã—ãŸã‚Šã€é›Œã‚’å¼·å§¦ã™ã‚‹æ§˜åã‚’å ±å‘Šã—ã¦ã„ã‚‹ æä¾›ç¤¾ã®éƒ½åˆã«ã‚ˆã‚Šã€å‰Šé™¤ã•ã‚Œã¾ã—ãŸã€‚ æ¦‚è¦ã®ã¿æŽ²è¼‰ã—ã¦ãŠã‚Šã¾ã™ã€‚ é–¢é€£ãƒ‹ãƒ¥ãƒ¼ã‚¹ ãƒ©ãƒ³ã‚ãƒ³ã‚° ç·åˆ å›½å†… æ”¿æ²» æµ·å¤– çµŒæ¸ˆ IT ã‚¹ãƒãƒ¼ãƒ„ èŠ¸èƒ½ å¥³å

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

Gitã®ãƒªãƒ“ã‚¸ãƒ§ãƒ³ç•ªå·(SHA-1ã®ã‚¢ãƒ¬)ã®æ£ä½“ã‚’ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’èªã‚“ã§èª¿ã¹ã¦ã¿ãŸ #AdventCalendar #git - Qiita

hiroyukim 2013/09/12

git

ãƒªãƒ³ã‚¯

Pythonç‰ˆã®SCWã‚’ä½œã£ãŸ(ã¤ã„ã§ã«ç–Žãªç´ æ€§ã‚’å–ã‚‹ã‚ˆã†ã«ã—ãŸ) - EchizenBlog-Zwei

Pythonã«æ…£ã‚Œã‚‹ãŸã‚ã«SCWã‚’æ›¸ã„ãŸã€‚å‰ã«Perlã§æ›¸ã„ãŸã®ã¯å¯†ãªç´ æ€§ã‚’å‰æã«ã—ã¦ã„ãŸã€‚ã“ã‚Œã ã¨ä¸ä¾¿ãªã®ã§ä»Šå›žã¯ç–Žãªç´ æ€§ã‚’å–ã‚‹ã‚ˆã†ã«å¤‰æ›´ã—ãŸã€‚ https://github.com/echizentm/ConfidenceWeighted ä»¥ä¸‹ã€ã‚µãƒ³ãƒ—ãƒ«ã®å‹•ä½œä¾‹ã€‚ $$ python sample.py < colors.json update:[1, {"B": 0, "R": 255, "G": 0}] update:[-1, {"B": 0, "R": 0, "G": 255}] update:[-1, {"B": 255, "R": 0, "G": 0}] update:[-1, {"B": 255, "R": 0, "G": 255}] update:[1, {"B": 255, "R": 255, "G": 0}] update:[1, {"B": 0, "R": 255,

hiroyukim 2013/09/12

python
SCW

ãƒªãƒ³ã‚¯

ã€Œç›®çš„ã‚’è¨€ã†ã¨ã€ç†æƒ³ã¯ãƒ€ãƒ¡ã«ãªã‚‹ã€â”€â”€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æ•™è‚²ã§å¤§åˆ‡ãªã“ã¨ï¼ˆé˜¿éƒ¨å’Œåºƒæ°ã«èžãï¼šå¾Œç·¨ï¼‰ | ã‚µã‚¤ãƒœã‚¦ã‚ºå¼

ãƒžãƒã‚¸ãƒ¡ãƒ³ãƒˆ æ–°ã—ã„ãƒãƒ¼ãƒ ã®ã‚ã‚Šæ–¹ã‚’æŽ¢æ±‚ å°±æ´» å°±æ´»ç”Ÿå¿…è¦‹ï¼ã‚µã‚¤ãƒœã‚¦ã‚ºã®ç–‘å• ãƒ†ã‚£ãƒ¼ãƒ«çµ„ç¹” ä¼šç¤¾ã®ã€Œã‚ãŸã‚Šã¾ãˆã€ãŒå¤‰ã‚ã‚‹ å¤šæ§˜æ€§ 100äºº100é€šã‚Šã®å€‹æ€§ ãƒ¯ãƒ¼ã‚¯ã‚¹ã‚¿ã‚¤ãƒ« åƒãæ–¹ã€ç”Ÿãæ–¹ã€ã‚‚ã£ã¨è‡ªç”±ã« é’é‡Žæ…¶ä¹… ã‚µã‚¤ãƒœã‚¦ã‚ºç¤¾é•·ã®æƒ³ã„ã¨è¦šæ‚Ÿ ã‚ãƒ£ãƒªã‚¢ äººç”Ÿã®ã€Œç©ã¿ä¸Šã’æ–¹ã€ã‚’è¦‹ç›´ã™ è¤‡æ¥ è¤‡æ•°ã®ã€Œæœ¬æ¥ã€ã‚’ã‚‚ã¤åƒãæ–¹ äººäº‹åˆ¶åº¦ å¤šæ§˜ãªåƒãæ–¹ã‚’æ”¯ãˆã‚‹ä»•çµ„ã¿ ãƒžãƒ³ã‚¬ ã‚µã‚¯ãƒƒã¨æ‰‹è»½ã«èªã‚ã‚‹ï¼

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

Charming Python: Functional programming in Python, Part 3

IBM Developer is your one-stop location for getting hands-on training and learning in-demand skills on relevant techno logies such as generative AI, data science, AI, and open source.

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

RDBMSã§ä½¿ã‚ã‚Œã‚‹Bæœ¨ã‚’å¦ã¼ã† ï¼ˆ1/3ï¼‰ï¼ ï¼ IT

ç¬¬5å›ž RDBMSã§ä½¿ã‚ã‚Œã‚‹Bæœ¨ã‚’å¦ã¼ã† ã¯ã‚„ã—ã¤ã¨ã‚€ ã‚¢ãƒŠãƒã‚¤ãƒ ãƒ†ã‚¯ãƒŽãƒã‚¸ãƒ¼æ ªå¼ä¼šç¤¾ 2009/6/22 ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘ã«ã‚ˆã£ã¦ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯éš ãºã„ã•ã‚Œã¦ã„ã‚‹ã“ã¨ãŒå¤šããªã£ãŸã€‚ã—ã‹ã—ã€ã€Œç”¨æ„ã•ã‚Œã¦ã„ãªã„å‡¦ç†ã€ãŒæ±‚ã‚ã‚‰ã‚ŒãŸã¨ãã«å¯¾å¿œã§ãã‚‹ã ã‚ã†ã‹ï¼ˆç·¨é›†éƒ¨ï¼‰ ç¬¬3å›žã€ŒAVLæœ¨ã§æœ¨æ§‹é€ ã‚’å¦ã¼ã†ã€ã€ç¬¬4å›žã€Œã‚‚ã£ã¨AVLæœ¨ã§æœ¨æ§‹é€ ã‚’å¦ã¼ã†ã€ã¨2å›žé€£ç¶šã§AVLæœ¨ã«ã¤ã„ã¦è§£èª¬ã—ã¾ã—ãŸã€‚ ä»Šå›žã¯Aã®å¾Œã ã‹ã‚‰Bã¨ã„ã†ã‚ã‘ã§ã¯ã‚ã‚Šã¾ã›ã‚“ãŒã€Bæœ¨ï¼ˆB-Treeï¼‰ã‚’å–ã‚Šä¸Šã’ã¾ã™ã€‚ Bæœ¨ã®å¤‰ç¨®ã§ã‚ã‚‹B+æœ¨ã‚„B*æœ¨ã¯ã€Oracleã‚„PostgreSQLã€Firebirdãªã©ã®ãƒªãƒ¬ãƒ¼ã‚·ãƒ§ãƒŠãƒ«ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã§ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã¨ã—ã¦åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ã€ãƒ¡ã‚¸ãƒ£ãƒ¼ãªæœ¨æ§‹é€ ã§ã™ã€‚ ç†è€…ã¯Delphi 2009ã§ã‚µãƒ³ãƒ—ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ä½œæˆã—ã¦ã„ã¾ã™ãŒã€Delphiã‚’ãŠæŒã¡ã§ãªã„æ–¹ã¯ä¸‹è¨˜ã®URLã‹ã‚‰TurboDelphiã‚’ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã—ã¦

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

Amittai F.Aviram: Interactive B+ Tree

Interactive B+ Tree (C) A B+ tree ("bee plus tree") is a data structure used as an index to facilitate fast access to the elements of a larger body of data, such as the entries in a database or the blocks of memory storage ("pages") in an operating system. Each target object (entry, page) is associated with an index key. The B+ tree is laid out like a family tree, where each node has some number o

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

blist

So you can see the performance of the blist in more detail, several performance graphs available at the following link: http://stutzbachenterprises.com/blist/ Example usage: >>> from blist import * >>> x = blist([0]) # x is a blist with one element >>> x *= 2**29 # x is a blist with > 500 million elements >>> x.append(5) # append to x >>> y = x[4:-234234] # Take a 500 million element slice from x

hiroyukim 2013/09/12

python
btree

ãƒªãƒ³ã‚¯

B+ tree - Wikipedia

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article's use of external links may not follow Wikipedia's policies or guidelines. Please improve this article by removing excessive or inappropriate external links, and converting useful links where appropriate into footnote references. (October 201

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

A quick introduction to innodb_ruby

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

The physical structure of InnoDB index pages

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

B+Tree index structures in InnoDB

hiroyukim 2013/09/12

btree
index

ãƒªãƒ³ã‚¯

ãªãœBTreeãŒIndexã«ä½¿ã‚ã‚Œã¦ã„ã‚‹ã®ã‹ - maru source

â€»ã“ã®å†…å®¹ã¯å€‹äººçš„ãªè€ƒå¯Ÿãªã®ã§ã€é–“é•ã£ã¦ã„ã‚‹ç®‡æ‰€ã‚‚ã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ãã†ã„ã†éƒ¨åˆ†ã‚’è¦‹ã¤ã‘ãŸéš›ã¯ãœã²æ•™ãˆã¦ä¸‹ã•ã„ã€‚ RDBMSã®æ¤œç´¢ã‚’æ—©ãã™ã‚‹ãŸã‚ã«Indexã£ã¦ä½¿ã„ã¾ã™ã‚ˆãã€‚ä¾‹ãˆã°ã“ã‚“ãªãƒ†ãƒ¼ãƒ–ãƒ« CREATE TABLE user ( id INT UNSIGNED NOT NULL, name VARCHAR(255) NOT NULL, UNIQUE INDEX (id) ); idã‚«ãƒ©ãƒ ã«Indexã‚’å¼µã£ã¦ã„ã¾ã™ã€‚ã“ã‚Œã¯idã§ã®æ¤œç´¢ã‚’é«˜é€Ÿã«ã™ã‚‹ãŸã‚ã§ã™ã€‚ã“ã“ã§idã‚«ãƒ©ãƒ ã«IndexãŒè²¼ã£ã¦ã„ãªã„å ´åˆã¨æ¯”ã¹ã‚‹ã¨æ¤œç´¢æ™‚é–“ãŒå¤§å¹…ã«å¤‰ã‚ã£ã¦ãã¦ã—ã¾ã„ã¾ã™ï¼ˆç‰¹ã«ãƒ¬ã‚³ãƒ¼ãƒ‰ãŒå¤šããªã£ãŸæ™‚) ã§ã¯ãªãœIndexã‚’è²¼ã‚‹ã¨æ¤œç´¢ãŒæ—©ããªã‚‹ã‚“ã§ã—ã‚‡ã†ï¼Ÿï¼Ÿ Indexã¨ã¯ãã®åã®é€šã‚Šç´¢å¼•ã‚’æ„å‘³ã—ã¾ã™ã€‚ç‰¹å®šã®ã‚«ãƒ©ãƒ ã®ç´¢å¼•ã‚’ä½œæˆã—ã¦ãŠãã“ã¨ã§æ¤œç´¢ã‚’é«˜é€ŸåŒ–ã—ã¾ã™ã€‚ (æœ¬ã®æœ€å¾Œã«ã‚ˆã¿ãŒãªé †ã§å˜èªžãŒä¸¦ã¹ã‚‰ã‚ŒãŸã‚Šã—ã¦ã„ã¾ã™

hiroyukim 2013/09/12

ãƒªãƒ³ã‚¯

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ã‚¿ã‚°

2013å¹´9æœˆ12æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (13ä»¶)

å®Ÿã¯ã‚¨ã‚°ã™ãŽã‚‹ã‚¤ãƒ«ã‚«ã®ç”Ÿæ…‹ - ãƒ©ã‚¤ãƒ–ãƒ‰ã‚¢ãƒ‹ãƒ¥ãƒ¼ã‚¹

Gitã®ãƒªãƒ“ã‚¸ãƒ§ãƒ³ç•ªå·(SHA-1ã®ã‚¢ãƒ¬)ã®æ£ä½“ã‚’ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’èªã‚“ã§èª¿ã¹ã¦ã¿ãŸ #AdventCalendar #git - Qiita

Pythonç‰ˆã®SCWã‚’ä½œã£ãŸ(ã¤ã„ã§ã«ç–Žãªç´ æ€§ã‚’å–ã‚‹ã‚ˆã†ã«ã—ãŸ) - EchizenBlog-Zwei

Charming Python: Functional programming in Python, Part 3

RDBMSã§ä½¿ã‚ã‚Œã‚‹Bæœ¨ã‚’å¦ã¼ã† ï¼ˆ1/3ï¼‰ï¼ ï¼ IT

Amittai F.Aviram: Interactive B+ Tree

blist

B+ tree - Wikipedia

A quick introduction to innodb_ruby

The physical structure of InnoDB index pages

B+Tree index structures in InnoDB

ãªãœBTreeãŒIndexã«ä½¿ã‚ã‚Œã¦ã„ã‚‹ã®ã‹ - maru source

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬4é€±ï¼‰

ã€Œã‚ã¨ã§èªã‚€ã€ã‚¿ã‚°ã§æŒ¯ã‚Šè¿”ã‚‹2024å¹´ ã€œä»Šå¹´ã®ã€Œã‚ã¨ã§èªã‚€ã€ã€ä»Šå¹´ã®ã†ã¡ã«ã€œ

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬3é€±ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

ã‚¿ã‚°

2013å¹´9æœˆ12æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (13ä»¶)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬4é€±ï¼‰

ã€Œã‚ã¨ã§èª­ã‚€ã€ã‚¿ã‚°ã§æŒ¯ã‚Šè¿”ã‚‹2024å¹´ ã€œä»Šå¹´ã®ã€Œã‚ã¨ã§èª­ã‚€ã€ã€ä»Šå¹´ã®ã†ã¡ã«ã€œ

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚­ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬3é€±ï¼‰

å…¬å¼Twitter

ã‚­ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹

2013å¹´9æœˆ12æ—¥ã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (13ä»¶)

ãŠçŸ¥ã‚‰ã›

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬4é€±ï¼‰

ã€Œã‚ã¨ã§èªã‚€ã€ã‚¿ã‚°ã§æŒ¯ã‚Šè¿”ã‚‹2024å¹´ ã€œä»Šå¹´ã®ã€Œã‚ã¨ã§èªã‚€ã€ã€ä»Šå¹´ã®ã†ã¡ã«ã€œ

ä»Šé€±ã®ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ï¼ˆ2024å¹´12æœˆç¬¬3é€±ï¼‰

å…¬å¼Twitter

ã‚ãƒ¼ãƒœãƒ¼ãƒ‰ã‚·ãƒ§ãƒ¼ãƒˆã‚«ãƒƒãƒˆä¸€è¦§

å…¬å¼Twitter

ã¯ã¦ãªã®ã‚µãƒ¼ãƒ“ã‚¹