Polling with ETag caching

Polling for changes (repeatedly asking server if there are any new changes) introduces high load on a GitLab instance, because it usually requires executing at least a few SQL queries. This makes scaling large GitLab instances (like GitLab.com) very difficult so we do not allow adding new features that require polling and hit the database.

Instead you should use polling mechanism with ETag caching in Redis.

How to use it

  1. Add the path of the endpoint which you want to poll to Gitlab::EtagCaching::Router.
  2. Set the polling interval header for the response with Gitlab::PollingInterval.set_header.
  3. Implement cache invalidation for the path of your endpoint using Gitlab::EtagCaching::Store. Whenever a resource changes you have to invalidate the ETag for the path that depends on this resource.
  4. Check that the mechanism works:
    • requests should return status code 304
    • there should be no SQL queries logged in log/development.log

How it works

Cache Miss:

Cache miss

Cache Hit:

Cache hit

  1. Whenever a resource changes we generate a random value and store it in Redis.
  2. When a client makes a request we set the ETag response header to the value from Redis.
  3. The client caches the response (client-side caching) and sends the ETag as the If-None-Match header with every subsequent request for the same resource.
  4. If the If-None-Match header matches the current value in Redis we know that the resource did not change so we can send 304 response immediately, without querying the database at all. The client’s browser uses the cached response.
  5. If the If-None-Match header does not match the current value in Redis we have to generate a new response, because the resource changed.

Do not use query parameters (for example ?scope=all) for endpoints where you want to enable ETag caching. The middleware takes into account only the request path and ignores query parameters. All parameters should be included in the request path. By doing this we avoid query parameter ordering problems and make route matching easier.

For more information see: