{
  "slug": "silo",
  "term": "Silo",
  "aliases": [],
  "definition": "Silo is a multicore in-memory transaction engine that combines optimistic validation with epoch-based persistence.",
  "note": "Commit: Silo locks its write set in a global order, then validates record versions and lock states before installing updates. Optimistic execution therefore does not mean a lock-free commit protocol. [silo-2013]\n\nAbsence: Returned records alone cannot protect a range scan against new keys. Silo also validates versions of overlapping index leaves; failed lookups track the leaf where the missing key would belong. [silo-2013]\n\nPersistence: The 2013 prototype evaluated logging but lacked full checkpointing and recovery. SiloR later added parallel recovery and checkpoints. Its persistent-epoch file must be synchronized after the log synchronization before results are released; a fuzzy checkpoint still needs log replay. [silo-2013] [silor-2014]\n\nExample: Two transactions each reserve a different key only if a shared range is empty. In a six-schedule educational model, validating only returned rows permits two reservations in four schedules. Adding leaf-version validation preserves at most one reservation in all six. These counts enumerate the model, not a workload failure rate. [silo-witness]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Silo's 2013 throughput evaluation uses in-process clients rather than networked clients, so its benchmark rates are not end-to-end service rates.",
      "citationIds": [
        "silo-2013"
      ]
    }
  ],
  "related": [
    "hyder",
    "group-commit",
    "foedus",
    "optimistic-concurrency-control",
    "masstree"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-15",
  "citations": [
    {
      "id": "silo-2013",
      "title": "Tu et al. Speedy Transactions in Multicore In-Memory Databases. SOSP 2013, sections 1, 4.4, 4.6, 4.10. DOI: 10.1145/2517349.2522713.",
      "url": "https://www.read.seas.harvard.edu/~kohler/pubs/tu13speedy.pdf",
      "accessed": "2026-11-15"
    },
    {
      "id": "silor-2014",
      "title": "Zheng et al. Fast Databases with Fast Durability and Recovery Through Multicore Parallelism. OSDI 2014, sections 3.5, 4 and 5.",
      "url": "https://www.read.seas.harvard.edu/~kohler/pubs/zheng14fast.pdf",
      "accessed": "2026-11-15"
    },
    {
      "id": "silo-witness",
      "title": "Hesela: six finite empty-range schedules, results and model assumptions",
      "url": "https://hesela.dev/research/silo-phantoms.json",
      "accessed": "2026-11-15"
    },
    {
      "id": "silo-model",
      "title": "Hesela: executable educational leaf-validation model (JavaScript)",
      "url": "https://hesela.dev/research/silo-phantoms.mjs",
      "accessed": "2026-11-15"
    },
    {
      "id": "silo-tests",
      "title": "Hesela: model regression tests and independent serial-order oracle",
      "url": "https://hesela.dev/research/silo-phantoms.test.mjs",
      "accessed": "2026-11-15"
    }
  ],
  "provenance": [
    "Source synthesis plus a finite constructed example, not a native Silo run, benchmark, crash test or new serializability proof.",
    "The model has fixed index leaves and atomic validation/install steps; it omits concurrent tree changes, placeholders, memory ordering, logging and retries.",
    "SiloR is a later extension, not an alias or evidence that recovery was already implemented in the original 2013 prototype."
  ]
}
