in reply to Re^2: memory-efficient hash kind for incremental sort
in thread memory-efficient hash kind for incremental sort
:-)
well, most of the dictionary are names and technical terms. I am building a citation data base, and need authors and titles. by 300 million, I am optimistic---it is a maximum layout for what I need to cover. many are duplicates...think "George" and "Michael" but also "Constantinopoulos" and "CAPM".
preferably, I want to allocate 2GB of RAM to the task. I now will check into the solutions that were suggested. Thanks a lot to everyone.
regards, /iaw
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^4: memory-efficient hash kind for incremental sort
by BrowserUk (Patriarch) on Jan 07, 2009 at 19:07 UTC | |
Re^4: memory-efficient hash kind for incremental sort
by kennethk (Abbot) on Jan 07, 2009 at 17:17 UTC |
In Section
Seekers of Perl Wisdom