Silo
Silo is a multicore in-memory transaction engine that combines optimistic validation with epoch-based persistence.
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. [1]
Absence: 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. [1]
Persistence: 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. [1] [2]
Example: 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. [3]
Relations
Limitations
- Silo's 2013 throughput evaluation uses in-process clients rather than networked clients, so its benchmark rates are not end-to-end service rates. [1]
Citations
- 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.
- Zheng et al. Fast Databases with Fast Durability and Recovery Through Multicore Parallelism. OSDI 2014, sections 3.5, 4 and 5.
- Hesela: six finite empty-range schedules, results and model assumptions
Further reading
- Hesela: executable educational leaf-validation model (JavaScript)
- Hesela: model regression tests and independent serial-order oracle
Sources & caveats
- 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.