Tombstones can live in a per-database hashtable (key -> version), because a deleted key has no object to hang a version on. Tombstones are required for correctness: without one, a deleted key reads as version 0 and an older concurrent write from the peer resurrects it. It can be garbage-collected by age which bounds how long a link may stay down before deletes can be lost.
Tombstones can live in a per-database hashtable (
key -> version), because a deleted key has no object to hang a version on. Tombstones are required for correctness: without one, a deleted key reads as version 0 and an older concurrent write from the peer resurrects it. It can be garbage-collected by age which bounds how long a link may stay down before deletes can be lost.