I have planned to use trie data structure implementation in dictionary application, but the problem is loading more than 10,000 words into the trie. Though trie takes out redundancy of letters and total memory loaded in primay would nothing more than couple of kbs but still the time required for loading all the words into the trie would take a lot of time nwould take even more if it's implemented for a mobile phone app..
Any suggestions of what could be done?