Hey Karl!
I definitely would leverage Google's API for this problem, but I actually
was more interested in the approach for this hierarchical type of problem.
To flatten or not to flatten, that is the question!
But yes, APis would allow me to check for user error when it comes to
cities and such
On Sunday, August 16, 2015, Sanket More wrote:
> Hey Nick!
>
> After I submitted my question, I went through lots of information sources
> and gathered some information.
> I feel like my question was based on many misconceptions about google app
> engine's datastore.
>
> I think I have a strategy
The general rule is optimize for your primary use case, denormalise to support
others.
In addition, enforce and support constraints In your code.
If your primary case is restaurant search, embed and index all necessary data.
This will be the fastest solution and easiest to work with
On Appengin
Hello! I am having so much trouble understanding datastore queries!
This is my problem.
I can't seem to figure out whether querying from the top of a tree down to
a end node is faster than querying through all end nodes.
I don't care about write cost or about transactions, I just want to know
wha
