サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
Wikipedia
attractivechaos.wordpress.com
Array and hash table are probably the most important data structures. Some programming languages such as Perl, Lua and Javascript, almost build the language core on top of the two data structures. While array is straightforward to implement, hash table is not. This is why we have paid continuous efforts in improving the hash table performance. This blog post reviews recent techniques not commonly
B-tree vs. Binary Search Tree September 24, 2008 by attractivechaos When talking about in-memory search tree, we usually think of various binary search trees: red-black tree, AVL tree, treap, splay tree and so on. We do not often think of B-tree, as B-tree is commonly introduced as an on-disk data structure rather than in-memory one. Is B-tree also a good data structure for in-memory ordered dicti
Notes: CPU time is measured in nanosecond for each operation. Memory is measured by TCmalloc. It is the memory difference before and after the allocation of the hash table, instead of the peak memory. In this experiment, integers are inserted in order and there are no collisions in the hash table. All these libraries provide similar API. Discussions Speed and memory. The larger the hash table, the
このページを最初にブックマークしてみませんか?
『attractivechaos.wordpress.com』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く