On Caching, Provisionally

Abstract

This document is a placeholder. It exists to demonstrate a post with several sections, code, and tags. Replace the contents with your real thoughts on caching — ideally the ones you have while building gocher.

Status of This Memo

Provisionally informational. This memo may be promoted to Standards Track once the author stops changing his mind about eviction policies.

1. The Problem

Caching is a bribe you pay to the database so it stops doing the same work twice. It works until it does not. This section should eventually contain the trade-offs: invalidation, consistency, and the fact that the cache is the source of truth until it is not.

2. A Worked Example

type shard struct {
	mu   sync.RWMutex
	page map[string]entry
}

A sharded, lock-per-shard map. The insert path:

func (s *shard) Get(key string) (entry, bool) {
	s.mu.RLock()
	e, ok := s.page[key]
	s.mu.RUnlock()
	return e, ok
}

3. What the Author Actually Wants to Say

Replace this blockquote with a real opinion. It should be specific enough that a colleague could quote it back at you in a review.

4. Conclusion

Placeholder posts should be replaced, not admired. This one has served its purpose.