Log Structured Merge Trees - ben stopford
It’s nearly a decade since Google released its ‘Big Table’ paper. One of the many cool aspects of that paper was the file organisation it uses. The approach is more generally known as the Log Structured Merge Tree, after this 1996 paper, although the algorithm described there differs quite significantly from most real-world implementations. LSM is now used in a number of products as the main file
A Fast, Minimal Memory, Consistent Hash Algorithm
We present jump consistent hash, a fast, minimal memory, consistent hash algorithm that can be expressed in about 5 lines of code. In comparison to the algorithm of Karger et al., jump consistent hash requires no storage, is faster, and does a better job of evenly dividing the key space among the buckets and of evenly dividing the workload when the number of buckets changes. Its main limitation is
Mutable Algorithms in Immutable Languages, Part 1 · tel.github.io
One of the big challenges you might face when learning a language like Haskell which favors immutability or purity is that suddenly all of the algorithms you once kept at your side have… well, by-and-large they’ve vanished. Many “imperative†algorithms rely upon mutable memory to work and it can be a challenge to remove that dependency. Usually in the process you’ll learn quite a bit about purely
Visualizing Algorithms
The power of the unaided mind is highly overrated… The real powers come from devising external aids that enhance cognitive abilities. —Donald Norman Algorithms are a fascinating use case for visualization. To visualize an algorithm, we don’t merely fit data to a chart; there is no primary dataset. Instead there are logical rules that describe behavior. This may be why algorithm visualizations are
サービス終了ã®ãŠçŸ¥ã‚‰ã›
サービス終了ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”利用ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“スã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“スを終了ã„ãŸã—ã¾ã—ãŸã€‚ 今後ã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”愛顧ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚
Examples of Hash Functions for Hash Table Lookup
Now that we have some tools for evaluating hash functions for table lookup, let's look at several common hashes. I usually define "ub4" as unsigned long int; it's supposed to be an unsigned 4-byte integer type. The additive hash, seen in commercial code: ub4 additive( char *key, size_t len, ub4 prime) { ub4 hash; size_t i; for (hash=(ub4)len, i=0; i<len; ++i) hash = hash+key[i]; return (hash % pri
What is the optimal algorithm for the game 2048?
I have recently stumbled upon the game 2048. You merge similar tiles by moving them in any of the four directions to make "bigger" tiles. After each move, a new tile appears at random empty position with a value of either 2 or 4. The game terminates when all the boxes are filled and there are no moves that can merge tiles, or you create a tile with a value of 2048. One, I need to follow a well-def
Gen I Capture Mechanics
Special thanks to a_magical_me, who started analyzing the algorithm, let me use his notes and then provided me with an assembly dump to pick up where he left off. The hacking genius is mostly his. If you were an avid player of Red, Blue and Yellow, you may have read the other capture mechanics sections and fleetingly wondered, "But what about the times in R/B/Y when it would say, 'The ball missed
Reddit’s empire is founded on a flawed algorithm - Ian's Tech Notes
Posted on December 9, 2013 Reddit has a bug in their code. This bug is currently present in their production platform, and has been for years. It affects one of the most important algorithms in the entire site, the “Hot†ranking algorithm for link popularity. It has real, demonstrable negative effects. It has been reported to Reddit’s technical team several times and never fixed. The Bug Reddit ne
Which hashing algorithm is best for uniqueness and speed? - Software Engineering Stack Exchange
Which hashing algorithm is best for uniqueness and speed? Example (good) uses include hash dictionaries. I know there are things like SHA-256 and such, but these algorithms are designed to be secure, which usually means they are slower than algorithms that are less unique. I want a hash algorithm designed to be fast, yet remain fairly unique to avoid collisions.
MARISA: Matching Algorithm with Recursively Implemented StorAge
Abstract: Matching Algorithm with Recursively Implemented StorAge (MARISA) 㯠Trie をコンパクトã«è¡¨ç¾ã™ã‚‹ç¨‹åº¦ã®èƒ½åŠ›ã‚’æŒã¤ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ï¼Žlibmarisa 㯠MARISA ã‚’ C++ ã§å®Ÿè£…ã—ãŸãƒ©ã‚¤ãƒ–ラリã§ã‚り，MARISA ã«ã‚ˆã‚‹è¾žæ›¸ã‚’構築ã—ãŸã‚Šï¼Œè¾žæ›¸ã‹ã‚‰ã®æ¤œç´¢ã‚’ãŠã“ãªã£ãŸã‚Šã§ãã¾ã™ï¼Žlibmarisa ã®åŸºæœ¬çš„ãªæ©Ÿèƒ½ã«å¯¾å¿œã™ã‚‹ã‚³ãƒžãƒ³ãƒ‰ãƒ©ã‚¤ãƒ³ãƒ„ールを用æ„ã—ã¦ã„ã‚‹ã®ã§ï¼Œè¾žæ›¸ã®ã‚µã‚¤ã‚ºãŒã©ã®ãらã„ã«ãªã‚‹ã®ã‹ï¼Œæ¤œç´¢ã«ã©ã®ãらã„時間ãŒã‹ã‹ã‚‹ã®ã‹ï¼Œãªã©ã‚’手軽ã«è©¦ã™ã“ã¨ãŒã§ãã¾ã™ï¼Ž æ¦‚è¦ Matching Algorithm with Recursively Implemented StorAge (MARISA) 㯠Trie ã«å¯¾ã™ã‚‹ã‚³ãƒ³ãƒ‘クトãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚り，動的ãªæ›´æ–°ã«ã¯å¯¾å¿œã—ã¦ã„ãªã„ã‚‚ã®ã®ï¼Œé«˜ã„空間効率ã¨
LOUDSトライã®ãƒ©ã‚¤ãƒ–ラリã®æ€§èƒ½ã‚’比較ã—ã¦ã¿ãŸ - EchizenBlog-Zwei
LOUDSã¯æœ¨æ§‹é€ ã‚’éžå¸¸ã«å°ã•ãªãƒ‡ãƒ¼ã‚¿ã‚µã‚¤ã‚ºã§è¡¨ç¾ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ç¨®ã€‚ã¨ãã«è‡ªç„¶è¨€èªžå‡¦ç†ã§ã¯ãƒˆãƒ©ã‚¤æœ¨ã¨ã„ã†æœ¨æ§‹é€ ãŒé‡è¦ã§å½¢æ…‹ç´ 解æžã‚„日本語入力(IME)ãªã©å¤šãã®å ´é¢ã§åˆ©ç”¨ã•ã‚Œã¦ã„る。 トライ木ã¨ã—ã¦ã¯double arrayãŒæœ‰å。LOUDSã¯double arrayより速度ã§åŠ£ã‚‹åé¢ã€ãƒ‡ãƒ¼ã‚¿ã‚µã‚¤ã‚ºã‚’éžå¸¸ã«å°ã•ã抑ãˆã‚‹ã“ã¨ãŒå¯èƒ½ã§ã‚る。ã“ã®ãŸã‚è¿‘å¹´ã€å¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿ã‚’扱ã†ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã—ã¦æ³¨ç›®ã•ã‚Œã¦ã„る。 LOUDSを用ã„ãŸãƒˆãƒ©ã‚¤æœ¨ã«ã¯å„ªã‚ŒãŸå®Ÿè£…ãŒã„ãã¤ã‹ã‚る。ãªã‹ã§ã‚‚有åãªã‚‚ã®ã¨ã—ã¦@s5yataæ°ã«ã‚ˆã‚‹marisa-trieã¨@hillbigæ°ã«ã‚ˆã‚‹ux-trieãŒã‚ã‚‹(ux-trieã®ã‚¯ãƒãƒ¼ãƒ³ã§ã‚ã‚‹rx-trieã¯GoogleIMEã§åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹)。 今回ã¯ã“れらã®ãƒ©ã‚¤ãƒ–ラリã¨ã€å‚考ã¾ã§ã«ç§ã®ä½œã£ãŸerika-trieを使ã£ã¦ã¿ã¦ç°¡å˜ã«æ€§èƒ½æ¯”較をã—ã¦ã¿ãŸã€‚ 評価
Natural Order String Comparison
by Martin Pool This project has moved to github.com/sourcefrog/natsort. Computer string sorting algorithms generally don't order strings containing numbers in the same way that a human would do. Consider: rfc1.txt rfc2086.txt rfc822.txt It would be more friendly if the program listed the files as rfc1.txt rfc822.txt rfc2086.txt Filenames sort properly if people insert leading zeros, but they don't
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
http://chaoran.me/assets/pdf/wfq-ppopp16.pdf
TinyPNG: Lossy compression for PNG that preserves full transparency. | Hacker News
VisuAlgo moves to https://visualgo.net/en
Home - Toronto Deep Learning Demos
Wilson’s Algorithm
冬ã®Lock-Freeç¥ã‚Š
clojure-contrib/lazy_seqs.clj at 78ee9b3e64c5ac6082fb223fc79292175e8e4f0c · richhickey/clojure-contrib
{{#tags}}- {{label}}
{{/tags}}