View Single Post
Old 05-10-2012, 07:12 PM   #14
Senior Member
Location: Boston

Join Date: Feb 2008
Posts: 693

@Richard: khash takes smaller memory than most search trees on small key-value pairs. The only implementations that beat khash on memory are stx-tree and my own kbtree.h, both of which are based on B-tree/B+-tree. Nonetheless, if you store large objects (I usually store pointers instead), tree structures can be more memory efficient.
lh3 is offline   Reply With Quote