How about building a radix tree with your classification attached as an attribute to each word and storing it as an object. You could load to memory at the start of each job and then merge any new words discovered at the end of the job and in between you get lookups without any network penalty. -regards, Shane Norris
On Feb 3, 3:54 pm, Albert <[email protected]> wrote: > @Calvin I've tried using unicode as key_names. It works fine with > mine. > > @Nick Interesting > > On Feb 3, 11:53 am, "Nick Johnson (Google)" <[email protected]> > wrote: > > > > > > > > > Hi Sofia, > > > Another option would be to use the Google Prediction API, which will do all > > this for you! > > > -Nick Johnson > > > On Thu, Feb 3, 2011 at 1:33 PM, sofia <[email protected]> wrote: > > > I'll try both suggestions and see how it goes. Thanks for the input :) > > > > -- > > > You received this message because you are subscribed to the Google Groups > > > "Google App Engine" 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/google-appengine?hl=en. > > > -- > > Nick Johnson, Developer Programs Engineer, App Engine > > Google Ireland Ltd. :: Registered in Dublin, Ireland, Registration Number: > > 368047 -- You received this message because you are subscribed to the Google Groups "Google App Engine" 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/google-appengine?hl=en.
