{
  "slug": "direct-recovery",
  "term": "DIRECT recovery",
  "aliases": [
    "Distributed error Isolation and RECovery Techniques"
  ],
  "definition": "DIRECT is a research approach that repairs small corrupted regions from distributed replicas while preserving the storage system's update order.",
  "note": "DIRECT combines fine-grained data recovery, local metadata redundancy and recovery ordered with writes. Logical replicas can have different physical file layouts, so a damaged block cannot simply be replaced by the same block from another replica. [direct]\n\nIts key-value implementation places a patch request in its own Paxos log entry. The donor supplies the preceding log-prefix state; installation is atomic. Keys absent from that complete range are implicit deletions, including deletions whose tombstones have already been compacted away. Affected historical snapshots need separate handling. [direct]\n\nAn empty complete range and an incomplete scan are different inputs. Only the former supports removing every local key in that range. The executable example compares range replacement with a merge that preserves a deleted key. [demo]\n\nEvaluation used injected errors, not a field trial of extended SSD lifetime. [direct] An earlier eight-system study independently showed that replication alone does not guarantee recovery from a single filesystem fault. [faults]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Recovery depends on identifying the affected logical range and obtaining an intact donor at the required consistency point.",
      "citationIds": [
        "direct"
      ]
    }
  ],
  "related": [
    "read-repair",
    "silent-data-corruption",
    "state-machine-replication",
    "lsm-tombstone",
    "sstable"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-22",
  "citations": [
    {
      "id": "direct",
      "title": "Tai et al. Who's Afraid of Uncorrectable Bit Errors? Online Recovery of Flash Errors with Distributed Redundancy. USENIX ATC 2019, sections 3-5.",
      "url": "https://www.usenix.org/system/files/atc19-tai.pdf",
      "accessed": "2026-11-22"
    },
    {
      "id": "faults",
      "title": "Ganesan et al. Redundancy Does Not Imply Fault Tolerance. USENIX FAST 2017.",
      "url": "https://www.usenix.org/conference/fast17/technical-sessions/presentation/ganesan",
      "accessed": "2026-11-22"
    },
    {
      "id": "demo",
      "title": "Hesela: complete-range patch counterexample, executable model and tests",
      "url": "https://hesela.dev/research/direct-recovery/README.md",
      "accessed": "2026-11-22"
    }
  ],
  "provenance": [
    "Primary source review, not a DIRECT implementation, hardware experiment or benchmark replication. [direct]",
    "The linked example is an in-memory teaching model. Its complete-range and log-position assertions are assumptions supplied by the caller, not a distributed proof. [demo]"
  ]
}
