Category Archives: algorithms

More Database Linkage / Research Material

Posted on December 23, 2009 by proj

Papers: Weaving Relations for Cache Performance C-Store a Column oriented DBMS Terms: Online Transaction Processing OLTP Online Analytic Processing OLAP Batch Processing Publish Subscribe Bitmap Indexes Strict Weak Ordering DB Normalization People: Ted Codd And his 12 rules Christopher Date … Continue reading →

Posted in algorithms, db | 1 Comment

Nice Collection of Hash Functions

Posted on November 5, 2008 by proj

Found a nice collection of hash routines written in D. These are easy to convert to other languages. I was just looking for Robert Sedgewick’s hash function since I didn’t have his book handy.

Posted in algorithms, d | Leave a comment

Investigating DB File Formats

Posted on October 20, 2008 by proj

Just a small post, maybe more to come detailing actual implementation details: Tree Structured Indexes Design of BTRFS

Posted in algorithms, db | Leave a comment

Build Huffman Compression in Ruby

Posted on January 8, 2008 by proj

Many wonderful things can be done with binary trees. One brilliant usage of the binary tree was proposed by David Huffman in 1951 at MIT which has since become the foundation for much of the compression technology available today. Huffman … Continue reading →

Posted in algorithms, ruby | 5 Comments

Build a Binary Tree in Ruby

Posted on January 7, 2008 by proj

Building algorithms in ruby is fun and rewarding. This binary tree doesn’t balance itself but it is simple and flexible using ruby blocks for visit and insert. Traversal style can be selected optionally to visit with :inorder, :preorder or :postorder. … Continue reading →

Posted in algorithms, ruby | 2 Comments