in reply to memory-efficient hash kind for incremental sort

What you want is an inverted index engine that allows wildcard querying. I haven't played with any of the ones on cpan but prefer something along the lines of solr or it's base lucene (cpan's Kinosearch is very similar). Those search engines are going to provide with a lot more than what you've actually requested (that may be a good thing ... or maybe not).

-derby
  • Comment on Re: memory-efficient hash kind for incremental sort