Treap: Hybrid of a binary tree and a binary heap. A randomized, ordered dictionary
datastructure used for the database (dohdbm) cache. It's not just in order of addition, it's in key order.
Bloom filter: Probabilistic set operations well suited to huge quantities of data; used for hardlink detection.