Home/ Questions/Q 8638351
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-12T10:42:27+00:00

Let’s say I have 1000 entities. I’d like users to find entities through a

  • 0

Let’s say I have 1000 entities. I’d like users to find entities through a faceted search in this way:

  1. user selects filter
  2. an ajax request is sent to GAE
  3. server returns the count of matching entities
  4. repeat until there are only a few entities

In other words every applied filter (just a checkbox) may cause up to 1000 reads (subsequent filters would cost less because fewer entities are returned).
This means that about 10 “searches” (= applying multiple filters) a day may eat up all my 50k free reads quota.

Memcaching results isn’t really an option: if I have 30 filters which one could apply, to store all combinations there would be 2^30=”over a billion” memcache entries (which would all have to be updated when an entity changes by making first a billion datastore reads).

evidently I didn’t get something. How would I efficiently cache or calculate results?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    If you only have a 1000 or so entities, your best bet, given the situation you have described, is to keep all 1000 entities in memcache and run your queries in memory instead of the datastore. In-memory query of a 1000 entities should be very fast.

    You can convert your entities to protobufs before storing in memcache. See this link.

    • 0