openpolitics.com

  • writing
  • quotes
  • Topics
    • academia
    • corruption
    • economics
    • education
    • environment
    • finance
    • history
    • hypertext
    • media
    • philosophy
    • psychology
    • religion
    • russia
    • ted nelson
  • about
← Previous Next →

High concurrency counters without sharding

Our solution has three major components:

  1. A ‘permanent’ count, stored in the datastore.
  2. A ‘current’ count, stored in memcache.
  3. A task queue task that updates the datastore with the total from memcache.
source: $link[host]

Tags: scalability

Read Original Source

Tim Langeman © 2025 · Genesis Framework · WordPress · Log in