SSTable
SSTable is an abbreviation for Sorted String Table. It is the fundamental storage building block in few of the modern Log Structured Merge Tree(LSM) based distributed database systems and key-value stores. It is used in Cassandra, BigTable and other systems. SSTable stands for Sorted Strings Table which stores a set of immutable row fragments or partitions in sorted order based on row/partition ke
ãã¾ãƒ¡ãƒ¢
データベースを使ã£ã¦ä½•ã‹ã™ã‚‹éš›ã«ã€ãƒ€ãƒŸãƒ¼ãƒ‡ãƒ¼ã‚¿ãŒè¶…大é‡ã«æ¬²ã—ããªã‚‹ã“ã¨ãŒã‚ã‚‹ã®ã§embulkã®input-pluginを作ã£ã¦ã¿ãŸã€‚ githubã®ãƒªãƒ³ã‚¯ 何もãªã„環境ã‹ã‚‰ãªã‚‰ $ wget https://bintray.com/artifact/download/embulk/maven/embulk-0.2.1.jar -O embulk.jar ã§embulk本体ã®ãŒé™ã£ã¦ãã‚‹ã®ã§ãれを使ã£ã¦ $ java -jar embulk.jar gem install embulk-plugin-input-random ã¨ã™ã‚Œã°ãƒ—ラグインãŒé™ã£ã¦ãる。 exec: {} in: type: random rows: 100 schema: id: primary_key name: string score: integer out: type: stdout ã“ã‚“ãªæ„Ÿã˜ã®config
大è¦æ¨¡ãƒ‡ãƒ¼ã‚¿å‡¦ç†ã®ãŸã‚ã®ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ | CiNii Research
データ列ã«å¯¾ã—ã¦æ¤œç´¢åŠ¹çŽ‡ãªã©ã‚’効率化ã™ã‚‹ãŸã‚ï¼Œç´¢å¼•ã‚’ä»˜åŠ ã™ã‚‹ã“ã¨ãŒã‚る．演算を効率化ã™ã‚‹ãŸã‚ã«ï¼Œãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ç‰¹å®šã®æƒ…å ±ã‚’ä»˜åŠ ã—ãŸã‚‚ã®ã‚’，ã“ã“ã§ã¯ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨å‘¼ã¶ã“ã¨ã¨ã™ã‚‹ï¼Žæœ¬ç¨¿ã§ã¯ã“ã®ã‚ˆã†ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ã†ã¡ï¼Œã‚‚ã¨ã®ãƒ‡ãƒ¼ã‚¿ã®é•·ã•nã«å¯¾ã—ã¦o(n)程度ã®ä»˜åŠ æƒ…å ±ã®ã¿ã‚’与ãˆã‚‹ï¼Œç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨å‘¼ã°ã‚Œã‚‹åˆ†é‡Žã«ã¤ã„ã¦è§£èª¬ã™ã‚‹ï¼Žç‰¹ã«ï¼Œæœ€ã‚‚基本的ã‹ã¤å¿œç”¨ç¯„囲ã®åºƒã„ビットベクトルã«é–¢ã™ã‚‹ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ç„¦ç‚¹ã‚’当ã¦ã‚‹ï¼Žãƒ“ットベクトルBã«å¯¾ã—ã¦ï¼Œå…ˆé ã‹ã‚‰i番目ã¾ã§ã®ãƒ“ットä¸ã®1ã®æ•°ã‚’与ãˆã‚‹rank1(B i)ã¨ï¼Œi番目ã®1ã®ä½ç½®ã‚’与ãˆã‚‹ select1(B i)ã¨ã„ã†æ¼”ç®—ã¯ï¼ŒåŸºæœ¬çš„ã‹ã¤é‡è¦ãªæ¼”ç®—ã§ã‚る．ã“れらã®æ¼”ç®—ãŒå®šæ•°æ™‚é–“ã§å¯èƒ½ãªç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¤ã„ã¦ï¼Œå…·ä½“çš„ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ を紹介ã—，次ã«ä»˜åŠ ã™ã‚‹ãƒ‡ãƒ¼ã‚¿ã‚µã‚¤ã‚ºã®ä¸‹ç•Œã«ã¤ã„ã¦ã®çµæžœã‚’示ã—，最後ã«ä»Šå¾Œã®å±•æœ›ã«ã¤ã„ã¦è¿°ã¹ã‚‹ï¼Ž
ブルームフィルタ - Wikipedia
ã“ã®é …ç›®ã§ã¯ã€ç¢ºçŽ‡çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¤ã„ã¦èª¬æ˜Žã—ã¦ã„ã¾ã™ã€‚ç”»åƒã«ã¼ã‹ã—åŠ¹æžœã‚’ä»˜åŠ ã™ã‚‹ç”»åƒãƒ•ã‚£ãƒ«ã‚¿ã«ã¤ã„ã¦ã¯ã€Œå·ç€¬ã®ãƒ–ルームフィルターã€ã‚’ã”覧ãã ã•ã„。 ブルームフィルタ（英語: Bloom filter）ã¯ã€1970å¹´ã« Burton H. Bloom ãŒè€ƒæ¡ˆã—ãŸç©ºé–“効率ã®è‰¯ã„ç¢ºçŽ‡çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚Šã€ã‚るデータãŒé›†åˆã®è¦ç´ ã§ã‚る（集åˆã«å«ã¾ã‚Œã¦ã„る）ã‹ã©ã†ã‹ã®åˆ¤å®šã«ä½¿ã‚れる。ãŸã ã—判定ã¯æ£ç¢ºã§ã¯ãªãã¦ã€å«ã¾ã‚Œã¦ã„ãªã„ã®ã«å«ã¾ã‚Œã¦ã„ã‚‹ã¨èª¤ã£ã¦åˆ¤å®šã™ã‚‹ã“ã¨å½é™½æ€§ï¼ˆfalse positive）ã®å¯èƒ½æ€§ãŒã‚る。ã—ã‹ã—å«ã¾ã‚Œã¦ã„ã‚‹ã‚‚ã®ã‚’å«ã¾ã‚Œã¦ã„ãªã„ã¨èª¤åˆ¤å®šã™ã‚‹ã“ã¨å½é™°æ€§ï¼ˆfalse negative）ã¯ãªã„。ãªãŠé›†åˆã«è¦ç´ ã‚’è¿½åŠ ã™ã‚‹ã“ã¨ã¯ã§ãã‚‹ãŒã€é›†åˆã‹ã‚‰è¦ç´ を削除ã™ã‚‹ã“ã¨ã¯ã§ããªã„（ãŸã ã—ã€æ‹¡å¼µã‚’ã—㟠counting filter ã§ã‚ã‚Œã°å‰Šé™¤ã‚‚ã§ãる）。集åˆã«è¦ç´ ã‚’è¿½åŠ ã—ã¦ã„ãã«ã¤ã‚Œã¦å½é™½æ€§ã®
Skip graphs
Skip Graphs James Aspnes, Gauri Shah Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003, pp. 384-393. Submitted to Journal of Algorithms. Abstract Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where elements are stored in separate nodes that may fail at any time.
Binary Indexed Tree (Fenwick Tree) - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
圧縮アルゴリズムã«ãŠã‘ã‚‹é©å¿œåž‹ç®—術符å·ã®å®Ÿè£…ã§ã¯ã€ç´¯ç©é »åº¦è¡¨ã‚’効率的ã«æ›´æ–°ã§ãã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ãŒå¿…è¦ã«ãªã‚Šã¾ã™ã€‚ã‚‚ã¨ã‚‚ã¨ç®—術符å·ã‚’実装ã™ã‚‹ã«ã¯ç´¯ç©é »åº¦è¡¨ãŒå¿…è¦ãªã®ã§ã™ãŒã€ã“ã‚ŒãŒé©å¿œåž‹ã«ãªã‚‹ã¨ã€è¨˜å·åˆ—ã‚’å…ˆé ã‹ã‚‰ç¬¦å·åŒ–ã—ãªãŒã‚‰ã€ã™ã§ã«è¦‹ãŸè¨˜å·ã®ç´¯ç©é »åº¦ã‚’æ›´æ–°ã—ã¦ã„ãå¿…è¦ãŒã‚ã‚‹ãŸã‚ã§ã™ã€‚ ç´¯ç©åº¦æ•°è¡¨ã‚’ナイーブã«å®Ÿè£…ã™ã‚‹ã¨ã€æ›´æ–°ã«ã¯ O(n) ã‹ã‹ã£ã¦ã—ã¾ã„ã¾ã™ã€‚é…列ã§è¡¨ã‚’æŒã£ã¦ã„ãŸå ´åˆã€é©å½“ãªè¦ç´ ã®é »åº¦ã«æ›´æ–°ãŒã‹ã‹ã‚‹ã¨ãã®è¦ç´ よりもå‰ã®è¦ç´ ã™ã¹ã¦ã‚’æ›´æ–°ã™ã‚‹å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚é©å¿œåž‹ç®—術符å·ã®ã‚ˆã†ã«è¨˜å·ã‚’符å·åŒ–ã™ã‚‹åº¦ã«æ›´æ–°ãŒã‹ã‹ã‚‹ã‚±ãƒ¼ã‚¹ã«ã¯å‘ã„ã¦ã„ã¾ã›ã‚“。 Binary Indexed Tree (BIT, P.Fenwick æ°ã®åå‰ã‚’å–ã£ã¦ Fenwick Tree ã¨å‘¼ã°ã‚Œã‚‹ã“ã¨ã‚‚ã‚るよã†ã§ã™) を使ã†ã¨ã€ç´¯ç©é »åº¦è¡¨ã‚’æ›´æ–° O(lg n)ã€å‚ç…§ O(lg n) ã§å®Ÿç¾ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚BIT ã¯æ›´
MIT OpenCourseWare OCW Home
Unlocking knowledge, Empowering Minds. Free lecture notes, exams, and videos from MIT. No registration required. Learn More about the OCW mission Free and open access to knowledge needs your support. When you donate to MIT OpenCourseWare, you open up possibilities for learners everywhere. Make your gift before our June 30 fundraising deadline. Chalk Radio: a podcast about inspired teaching at MIT
Grid File
A grid structure for queries on two search keys is a 2-dimensional grid, or array, indexed by values for the search keys. Figure 11.10 (textbook 11.31) shows part of a grid structure for the deposit file. Figure 11.10: Â Grid structure for deposit file. A particular entry in the array contains pointers to all records with the specified search key values. No special computations need to be done Onl
Xoilac tv - Xem BoÌng ÄaÌ TrÆ°Ì£c TiêÌp - TrÆ°Ì£c TuyêÌn Xôi LaÌ£c TV
Xoilac tv - Xem BoÌng ÄaÌ TrÆ°Ì£c TiêÌp - TrÆ°Ì£c TuyêÌn Xôi LaÌ£c TV Link xem bóng đá Xoilac cáºp nháºt ngà y 22-08-2024 Ngà y nay, nhu cầu xem bóng đá trá»±c tuyến trên má»i ná»n tảng ngà y cà ng gia tăng bởi nó mang lại rất nhiá»u lợi Ãch. Nháºn thức được tiá»m năng đó, kênh truc tiep bong da xoilac tv đã được tạo dá»±ng, cung cấp dịch vụ xem bong da online miá»…n phÃ, chất lượng cao dà nh cho ngÆ°á»i hâm má»™. Ngoà i ra,
ダブルé…列ã«ãŠã‘ã‚‹å‹•çš„æ›´æ–°ã®åŠ¹çŽ‡åŒ–アルゴリズム| CiNii Research
タイトル別å ダブル ãƒã‚¤ãƒ¬ãƒ„ ニ オケル ドウテ゠コウシン ノ コウリツカ アルゴリズムEfficient Dynamic Update Algorithms for a Double-array Structure è‡ªç„¶è¨€èªžå‡¦ç† ãƒˆãƒ©ã‚¤æ§‹é€ ã¯ã‚ーã®è¡¨è¨˜æ–‡å—å˜ä½ã«æ§‹æˆã•ã‚ŒãŸæœ¨æ§‹é€ を用ã„ã¦æ¤œç´¢ã™ã‚‹ã‚ー検索技法ã®1ã¤ã§ã‚り，自然言語辞書をä¸å¿ƒã¨ã—ã¦åºƒã用ã„られã¦ã„る．ã“ã®ãƒˆãƒ©ã‚¤æ§‹é€ を実ç¾ã™ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã—ã¦é«˜é€Ÿæ€§ã¨ã‚³ãƒ³ãƒ‘クト性を満足ã™ã‚‹ãƒ€ãƒ–ルé…列法ãŒã‚ã‚‹ãŒï¼Œã“ã®æ‰‹æ³•ã¯ï¼Œã‚ーã®æ›´æ–°ãŒé »ç¹ã«ç”Ÿã˜ãªã„検索法ã¨ã—ã¦ç¢ºç«‹ã—ã¦ã„ã‚‹ãŸã‚，動的検索法ã«æ¯”ã¹ã¦è¿½åŠ 時間ã¯é«˜é€Ÿã§ã‚ã‚‹ã¨ã¯ã„ãˆãšï¼Œã¾ãŸå‰Šé™¤ã§ç”Ÿã˜ã‚‹ä¸è¦ãªãƒŽãƒ¼ãƒ‰ã‚„未使用è¦ç´ ã«ã‚ˆã‚Šè¨˜æ†¶é‡ã«ç„¡é§„ãŒç”Ÿã˜ã¦ã„ãŸï¼Žæœ¬è«–æ–‡ã§ã¯ã“れらã®å•é¡Œã‚’解決ã—，ダブルé…列を動的検索法ã¨ã—ã¦ç¢ºç«‹ã™ã‚‹ãŸã‚，未使用è¦ç´ を連çµã™ã‚‹ã“ã¨ã§è¿½åŠ 処ç†ã‚’高速化ã™ã‚‹æ‰‹æ³•ï¼Œå‰Šé™¤æ™‚ã«ç”Ÿã˜ã‚‹ä¸è¦ãƒŽ
ã“ã‚Œã‹ã‚‰ã®Double Arrayã¯å‹•çš„æ›´æ–°ã«å¯¾å¿œã™ã‚‹ã¹ã - å°„æ’ƒã—ã¤ã¤å‰è»¢ 改
Double Arrayã®ã‚³ãƒ¼ãƒ‰ãªã‚“ã¦1年以上ã„ã˜ã£ã¦ãªã„ãã›ã«ãªã«ã‚’言ã£ã¦ã‚‹ã‚“ã ã“ã®å£ã¯ã¨è¨€ã†æ„Ÿã˜ã§ã™ãŒã€Double Arrayを作るã®ã§ã‚ã‚Œã°ã€å‹•çš„æ›´æ–°ã«å¯¾å¿œã•ã›ã‚‹ã¹ãã§ã‚ã‚‹ã¨ã€ãã†æ€ã†ã‚ã‘ã§ã™ã€‚ Double Arrayã®ãƒ¡ãƒªãƒƒãƒˆã¯ Trieã§ã‚ã‚‹ 速ㄠ(Ternary Search Treeã¨ã‹ã¨æ¯”ã¹ã‚‹ã¨)サイズもå°ã•ã„ ã¨ã„ã†æ„Ÿã˜ã ã£ãŸè¨³ã§ã™ãŒã€é€Ÿåº¦ã¯ã¨ã‚‚ã‹ãã€ã‚µã‚¤ã‚ºã§ã¯TxãŒä½¿ã£ã¦ã„るよã†ãªLOUDSã‚„LOUDS++ãªã©ã®åœ§ç¸®ã—ã¡ã‚ƒã†æ–¹å¼ã«å‹ã¦ãªã„ã®ã§ã€é™çš„ãªè¾žæ›¸ã¨ã—ã¦ã¯ã€é€Ÿåº¦ãŒè¶…é‡è¦ãªã¨ã“ã‚以外ã§ã¯LOUDSã‚„LOUDS++を使ã£ãŸè¾žæ›¸ã‚’使ã†ã®ãŒã„ã„ã®ã‹ãªã¨æ€ã†è¨³ã§ã™ã€‚辞書引ã以外ã®éƒ¨åˆ†ãŒãƒœãƒˆãƒ«ãƒãƒƒã‚¯ã§ã‚ã‚‹ã“ã¨ã‚‚多ã„ã ã‚ã†ã—ã。 ã¨è¨€ã†ã‚ã‘ã§ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«æ¯”較ã—ã¦Double Arrayã§ãªã«ã‹ä¾¿åˆ©ãªäº‹ãŒã§ããªã„ã‹ãªã¨ã„ã†ã¨ã€åœ§ç¸®ã‚’ã‹ã‘ã‚‹æ–¹å¼ã§ã¯ã‚„ã¯ã‚Šã€å‹•çš„ãªæ›´æ–°ãŒé›£
Computer Laboratory – Systems Research Group – NetOS: Practical lock-free data structures
Introduction Through careful design and implementation it's possible to build data structures that are safe for concurrent use without needing to manage locks or block threads. These non-blocking data structures can increase performance by allowing extra concurrency and can improve robustness by avoiding some of the problems caused by priority inversion in local settings, or machine and link failu
DO++ : é€éŽçš„データ圧縮
å¯é€†ãƒ‡ãƒ¼ã‚¿åœ§ç¸®åˆ†é‡Žã§ã€ç¾åœ¨ç ”究ãŒç››ã‚“ãªåˆ†é‡Žã®ä¸€ã¤ãŒã€ãƒ‡ãƒ¼ã‚¿ã‚’圧縮ã—ãŸçŠ¶æ…‹ã®ã¾ã¾å®šæ•°æ™‚é–“ã§ãƒ©ãƒ³ãƒ€ãƒ アクセスをサãƒãƒ¼ãƒˆã™ã‚‹ãƒ‡ãƒ¼ã‚¿åœ§ç¸®æ–¹å¼ã§ã™ï¼ˆword RAMモデルã§O(log n)サイズã®å¾©å…ƒãŒå®šæ•°æ™‚é–“)。 ã“ã‚Œã¯ã€ãƒ‡ãƒ¼ã‚¿ã‚’ã‚ãŸã‹ã‚‚圧縮ã—ã¦ã„ãªã„ã‹ã®ã‚ˆã†ã«æ‰±ãˆã‚‹ãŸã‚ã€é€éŽçš„データ圧縮/æ§‹é€ ã¨å‘¼ã°ã‚Œã¦ã„ã¾ã™ï¼ˆè‹±èªžã ã¨ã¾ã 決ã¾ã£ã¦ãªã„？)。 例ãˆã°1GBã®ãƒ‡ãƒ¼ã‚¿ã‚’圧縮ã—ãŸçŠ¶æ…‹ã§ã€é€”ä¸300MBç›®ã‹ã‚‰4Byteã ã‘復元ã—よã†ã¨ã„ã†ã®ãŒå®šæ•°æ™‚é–“ã§å®Ÿç¾ã§ãã‚‹ã‚ã‘ã§ã™ã€‚ã“ã‚Œã¯ç†è«–çš„ã«ã‚‚ã‹ãªã‚Šå¼·ã„ã“ã¨ã‚’ã„ã£ã¦ã„ã¦ï¼Œä¾‹ãˆã°ä»Šã‚ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒã€O(T)時間ã§ã‚ã‚‹å•é¡Œã‚’解ã‘ã‚‹ã¨ã„ã†ã®ãŒã‚ã£ãŸã‚‰ã€ãれを全ãåŒã˜O(T)時間ã®ã¾ã¾ãƒ‡ãƒ¼ã‚¿æ§‹é€ を圧縮ã—作æ¥é ˜åŸŸé‡ã‚’減らã™ã“ã¨ãŒã§ãã¾ã™ (ä¸€å¿œãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«å¯¾ã—èªã¿è¾¼ã¿æ“作ã—ã‹ç„¡ã„å ´åˆã€‚書ãè¾¼ã¿ã‚‚ã‚ã‚‹å ´åˆã¯ã¾ãŸã¡ã‚‡ã£ã¨é¢å€’ã«ãªã‚‹ï¼‰ ã“ã®ãƒ‡ãƒ¼ã‚¿ã‚’圧縮ã—ãŸã¾ã¾æ‰±ã†
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] よりå°ã•ã„ 木ã®é«˜ã•ã¯ã„ãŸã‚‹ã¨ã“ã‚一定。ã¤ã¾ã‚Šã€æ ¹ã‹ã‚‰æœ«ç«¯ã®ãƒšãƒ¼ã‚¸ï¼ˆè‘‰ï¼‰ã«è‡³ã‚‹ãƒã‚¤ãƒ³ã‚¿
物ç†çš„ãªæ ¼ç´æ–¹å¼
â–¡ 計算機ã§ä½¿ã‚れるデータã¯å¿…ãšä½•ãŒã—ã‹ã®è¨˜æ†¶åª’体上ã«ç½®ã‹ã‚Œã‚‹ï¼Ž â–¡ レジスタ (registers) CPU 内部ã«ç½®ã‹ã‚ŒãŸè¨˜æ†¶è£…ç½® プãƒã‚°ãƒ©ãƒ ã‹ã‚‰ã®ã‚¢ã‚¯ã‚»ã‚¹ã¯é«˜é€Ÿ (CPU ã®å‹•ä½œã‚¯ãƒãƒƒã‚¯ã«åˆã‚ã›ã‚‹å¿…è¦ãŒã‚ã‚‹ãŸã‚．) アーã‚テクãƒãƒ£ã®ä¸€éƒ¨ãªã®ã§ã‚µã‚¤ã‚ºã¯å›ºå®šã•ã‚Œã¦ã„ã‚‹ ( ãŒæ™®é€š) æ®ç™ºæ€§ (volatile): ã¤ã¾ã‚Šé›»æºãŒåˆ‡ã‚Œã‚‹ã¨å†…容ãŒæ¶ˆãˆã¦ãªããªã‚‹ â–¡ 主記憶 (main memory, MM) CPU ã®å¤–ã«ç½®ã‹ã‚ŒãŸè¨˜æ†¶è£…ç½® プãƒã‚°ãƒ©ãƒ ã‹ã‚‰ã¯ç›´æŽ¥èªã¿æ›¸ãå¯èƒ½ èªã¿æ›¸ãã«ã‹ã‹ã‚‹æ™‚é–“ã¯ä»Šã®ã¨ã“ã‚ 60ns 程度ãŒä¸»æµ 容é‡ã¯å¯å¤‰ã§ï¼Œç¾åœ¨ã¯ 数百 MB 〜 æ•° GB 程度ãŒæ™®é€š æ®ç™ºæ€§ (volatile) â–¡ 二次記憶装置 (secondary storage) CPU ã®å¤–ã«ç½®ã‹ã‚ŒãŸè¨˜æ†¶è£…ç½®ã§ã‚ã‚‹ãŒï¼Œ プãƒã‚°ãƒ©ãƒ ã‹ã‚‰ã¯ç›´æŽ¥èªã¿æ›¸ãã§ããªã„ã‚‚ã®ï¼Ž 例: フãƒãƒƒãƒ”ーディスク (FD)，
Matzã«ã£ã(2008-03-17)　「MacRubyã€
<< 2008/03/ 1 1. [Ruby] Ruby 1.9.0-1 snapshot released 2. é«˜æœ¨æµ©å…‰ï¼ è‡ªå®…ã®æ—¥è¨˜ - 公開éµæš—å·æ–¹å¼ã®èª¤ã‚Šè§£èª¬ã®æ°¾æ¿«ã‚’ãã‚ãã‚ã©ã’ã‚“ã‹ã›ã‚“㨠3. [Ruby] Lisa Awards: Biggest Hack for a Language Runtime on Dion Almaer's Blog 2 1. [教会] 第一安æ¯æ—¥ 3 1. [言語] CS 11: Python track: python idioms 2. [Ruby] Binary search algorithm - Wikipedia, the free encyclopedia 3. [OSS] Theological Cultural Analysis of the Free Software Movement 4. å°å¯ºä¿¡è‰¯ï¼šæ£ç›´ã€ãƒ†ãƒ¬ãƒ“ã¯ã‚‚ã†ãƒ€ãƒ¡ã‹ã‚‚
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
冬ã®Lock-Freeç¥ã‚Š
定兼 邦彦 (Kunihiko Sadakane) - ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ è¬›ç¾©è³‡æ–™ - researchmap
DBH - Disk Based Hashtables
spiteful.com
{{#tags}}- {{label}}
{{/tags}}