Just imagine a dictionary where I want to search on the (english) description. So the word lengths can vary like in any other normal english text. Number of distinct words is probably a few hundred thousand. For a "deep" search I want to search the description using something like "LIKE '%mystring%'". So ignoring word boundaries. mystring may be one letter, a subword, a word or multiple words.
The dictionary is read only. On Sep 29, 3:07 pm, bseib <[email protected]> wrote: > Ok. > > Can you describe more about your set of words. Are they all single > words? how many distinct words are there? what is the distribution of > word lengths? or are they phrases rather than words? Will the size of > this list change? > > -broc > > On Sep 28, 11:17 pm, mjc147 <[email protected]> wrote: > > > > > On Sep 28, 6:02 am, Broc Seib <[email protected]> wrote: > > > > Perhaps aTriedata structure? > > > I can see how that would be useful when searching on prefixes, but > > what about when doing free text search? > > > Also, by "mechanism" I was thinking more along the lines of database, > > flat file (like a CSV) etc rather than logical data structure. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Android Developers" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/android-developers?hl=en -~----------~----~----~----~------~----~------~--~---
