Why don't you consider splitting the keywords and maintaining a
memcache-resident HashMapString,id ?
J.Ganesan
www.DataStoreGwt.com
On Aug 26, 9:25 pm, realdope rte...@gmail.com wrote:
Hi,
I know that you cannot do a LIKE clause in BigTable. How do you get around
this issue?
Suppose I'm
Lets say you have book Harry potter
If you want to search this withH or Ha Har Harr then this facility provided
by google app engine, instead of Like use startWith .
Else if you really want to search it with arry or rry basically any word
in it, then you may saev every book name as SetString
In addition to the above, I'd say you might want to make new keyword
entities for each
keyword and store the reference/key to the original entities instead
of storing your keywords
as a list of properties in your original entity. A list of strings is
stored implicitly as
an embedded table so will
I think keeping Keyword in seprate entity will be slower
At time of writing you will be writing lots of entity instead of just one
You will be worrying about how keyword will be mapped to each entity...
iether by having a list of Keys in Keyword entity or specifying one to on
emapping where
You should read on list properties. This will allow you to store
keywords into a single property and search on them. You could manually
split your strings bu instead you can use an Analyser from Lucene or
Hibernate Search. The analyzer can be used without really using Lucene
or Hibernate.
You
