I've been reading about using Squat with Dovecot on large mailboxes. I was wondering if some of the memory usage during searching and indexing could be reduced by using a berkeley db? I've used this in the past for something similar and in BTREE mode it was very fast for millions of keys. I havent had time to look at how squat is implemented, but I thought I'd throw it out there...
-Ryan
